Applying SLD-Resolution to a Class of Non-Horn Logic Programs

DOI10.1093/JIGPAL/2.2.229MaRDI QIDQ4318172zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Grigoris Antoniou, Elmar Langetepe

Publication date 2 January 1995

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/34bd9355172bb4d0166b137381e254e32d1a5aa6

zbMATH Keywords

default reasoningHorn logic programmodel eliminationtheorem proving

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 4092826
• On SLDNF-resolution in logic programming with negation
• A transformational approach to negation in logic programming
• Case-free programs: An abstraction of definite horn programs
• Parsing as non-Horn deduction

Cited in

(5)

• Acyclic logic programs and the completeness of SLDNF-resolution
• Operational concepts of nonmonotonic logics. I: Default logic
• SLD-resolution reduction of second-order Horn fragments
• scientific article; zbMATH DE number 4092826 (Why is no real title available?)
• A class of programs for which SLDNF resolution and NAF rule are complete

This page was built for publication: Applying SLD-Resolution to a Class of Non-Horn Logic Programs

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