A completeness theorem for SLDNF resolution

DOI10.1016/0743-1066(89)90020-4MaRDI QIDQ3031954zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

• scientific article; zbMATH DE number 4108188
• A Completeness Result for SLDNF-Resolution
• A direct proof of the completeness of SLDNF-resolution
• scientific article; zbMATH DE number 3958704
• Acyclic logic programs and the completeness of SLDNF-resolution
• The completeness of SLDNF-resolution with respect to modal completion
• On the completeness of SLDENF-resolution
• ON THE PROPOSITIONAL SLDNF-RESOLUTION
• scientific article; zbMATH DE number 516997
• Completeness of SLDNF-resolution for nonfloundering queries

Cited in

(27)

• Acyclic logic programs and the completeness of SLDNF-resolution
• Unfold/fold transformation of stratified programs
• SLDNF-resolution with equality
• 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
• Graph properties for normal logic programs
• A transformation system for deductive database modules with perfect model semantics
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• SLT-resolution for the well-founded semantics
• On the completeness of SLDENF-resolution
• A sound and complete semantics for a version of negation as failure
• Generalising unit-refutation completeness and SLUR via nested input resolution
• The completeness of SLDNF-resolution with respect to modal completion
• Completeness of SLDNF-resolution for nonfloundering queries
• scientific article; zbMATH DE number 3958704 (Why is no real title available?)
• scientific article; zbMATH DE number 4108188 (Why is no real title available?)
• A direct proof of the completeness of SLDNF-resolution
• scientific article; zbMATH DE number 516997 (Why is no real title available?)
• A new definition of SLDNF-resolution
• Levationis Laus
• A note on SLDNF-resolution
• A Completeness Result for SLDNF-Resolution
• Soundness and completeness versus lifting property
• A class of programs for which SLDNF resolution and NAF rule are complete
• Strict completion of logic programs
• First order compiler: A deterministic logic program synthesis algorithm
• Protected completions of first-order general logic programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3031954)