A Completeness Result for SLDNF-Resolution

DOI10.1016/S0743-1066(14)80003-4MaRDI QIDQ4696742zbMATH OpenFDO

Authors Karl Stroetmann

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1016/S0743-1066(14)80003-4

zbMATH Keywords

completenessmodesSLDNF-resolutionordered programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 3958704
• A completeness theorem for SLDNF resolution
• Completeness of SLDNF-resolution for nonfloundering queries
• Acyclic logic programs and the completeness of SLDNF-resolution
• A direct proof of the completeness of SLDNF-resolution

Cited in

(11)

• The relative complexity of analytic tableaux and SL-resolution
• A class of programs for which SLDNF resolution and NAF rule are complete
• The completeness of SLDNF-resolution with respect to modal completion
• Acyclic logic programs and the completeness of SLDNF-resolution
• First-order theories for pure Prolog programs with negation
• SLT-resolution for the well-founded semantics
• Completeness of SLDNF-resolution for nonfloundering queries
• Generalising unit-refutation completeness and SLUR via nested input resolution
• A completeness theorem for SLDNF resolution
• Logic programming and knowledge representation---The A-Prolog perspective
• scientific article; zbMATH DE number 3958704 (Why is no real title available?)

This page was built for publication: A Completeness Result for SLDNF-Resolution

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