Completeness of SLDNF-resolution for nonfloundering queries

DOI10.1016/0743-1066(95)00118-2zbMath0874.68050OpenAlexW2098495937MaRDI QIDQ3129497

Włodzimierz Drabent

Publication date: 10 November 1997

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(95)00118-2

zbMATH Keywords

SLDNF-resolution

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (4)

First-order theories for pure Prolog programs with negation ⋮ On correctness of normal logic programs ⋮ Négation constructive et axiomatique interne ⋮ Logic programming and knowledge representation---The A-Prolog perspective

This page was built for publication: Completeness of SLDNF-resolution for nonfloundering queries