ON THE PROPOSITIONAL SLDNF-RESOLUTION

DOI10.1142/S0129054196000269MaRDI QIDQ3126020zbMATH OpenFDO

Authors Jan Plaza

Publication date 7 August 1997

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054196000269

zbMATH Keywords

propositional logic programsSLDNF-resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• CUT-PROPERTY AND NEGATION AS FAILURE
• On SLDNF-resolution in logic programming with negation
• scientific article; zbMATH DE number 1349998
• Modal Logic and Negation as Failure

Cited in

(9)

• Acyclic logic programs and the completeness of SLDNF-resolution
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• SLT-resolution for the well-founded semantics
• On SLDNF-resolution in logic programming with negation
• A completeness theorem for SLDNF resolution
• scientific article; zbMATH DE number 956484 (Why is no real title available?)
• scientific article; zbMATH DE number 1349998 (Why is no real title available?)
• CUT-PROPERTY AND NEGATION AS FAILURE
• A class of programs for which SLDNF resolution and NAF rule are complete

This page was built for publication: ON THE PROPOSITIONAL SLDNF-RESOLUTION

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