A new definition of SLDNF-resolution

DOI10.1016/0743-1066(94)90051-5MaRDI QIDQ4285644zbMATH OpenOpenAlexWikidataFDO

Authors Krzysztof R. Apt, Kees Doets

Publication date 18 September 1994

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

Full work available at URL http://dare.uva.nl/personal/pure/en/publications/a-new-definition-of-sldnfresolution(2f57d7cb-71d4-495b-a4da-7c6a6640bf5c).html

zbMATH Keywords

SLDNF-resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A note on SLDNF-resolution
• Completeness of SLDNF-resolution for nonfloundering queries
• SLDNF-resolution with equality
• SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
• A completeness theorem for SLDNF resolution

Cited in

(6)

• A declarative approach for first-order built-in's of Prolog
• Probabilistic reasoning with answer sets
• A note on SLDNF-resolution
• A semantic approach for web reasoning
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Making assumptions in the automated derivation

This page was built for publication: A new definition of SLDNF-resolution

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