A completeness theorem for SLDNF resolution

DOI10.1016/0743-1066(89)90020-4zbMath0689.68107OpenAlexW1993979893MaRDI QIDQ3031954

Lawrence Cavedon, John W. Lloyd

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0743-1066(89)90020-4

zbMATH Keywords

completeness of SLDNF resolutioncompleteness of the negation as failure rule

Mathematics Subject Classification ID

Related Items (11)

First order compiler: A deterministic logic program synthesis algorithm ⋮ Protected completions of first-order general logic programs ⋮ Acyclic logic programs and the completeness of SLDNF-resolution ⋮ Unfold/fold transformation of stratified programs ⋮ A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses ⋮ Equivalence-preserving first-order unfold/fold transformation systems ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Graph properties for normal logic programs ⋮ A transformation system for deductive database modules with perfect model semantics ⋮ Strict completion of logic programs ⋮ A sound and complete semantics for a version of negation as failure

This page was built for publication: A completeness theorem for SLDNF resolution