A class of programs for which SLDNF resolution and NAF rule are complete

DOI10.1016/0304-3975(93)90246-PMaRDI QIDQ689290zbMATH OpenFDO

Authors Stefano Baratella

Publication date 22 September 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

allowed programslocally call-consistent programsnegation as-finite-failureSLDNF resolution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 3958704
• A Completeness Result for SLDNF-Resolution
• scientific article; zbMATH DE number 4108188
• Acyclic logic programs and the completeness of SLDNF-resolution
• A completeness theorem for SLDNF resolution
• A direct proof of the completeness of SLDNF-resolution
• scientific article; zbMATH DE number 516997
• Applying SLD-Resolution to a Class of Non-Horn Logic Programs
• ON THE PROPOSITIONAL SLDNF-RESOLUTION
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs

Cites work

• scientific article; zbMATH DE number 4176422 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 3559512 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
• A completeness theorem for SLDNF resolution
• A kripke-kleene semantics for logic programs*
• Acyclic logic programs and the completeness of SLDNF-resolution
• Completed logic programs and their consistency
• Graph properties for normal logic programs
• Model theory
• Negation in logic programming
• Partial models and logic programming
• The consistency of negation as failure

Cited in

(6)

• Acyclic logic programs and the completeness of SLDNF-resolution
• A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
• scientific article; zbMATH DE number 515746 (Why is no real title available?)
• scientific article; zbMATH DE number 3958704 (Why is no real title available?)

This page was built for publication: A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete

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