A correct logic programming computation of default logic extensions

DOI10.1023/A:1005771523328MaRDI QIDQ679244zbMATH OpenOpenAlexFDO

Authors Grigoris Antoniou, Elmar Langetepe

Publication date 3 September 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005771523328

zbMATH Keywords

default logicimplementationlogic programmingSLDNF-resolution

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Other nonclassical logic (03B60) Logic programming (68N17)

Review text

The main contribution of this paper is to give an implementation of a subset of default logic into (normal) logic programs with standard operational semantics (SLDNF-resolution). First, a translation of a class of default theories into logic programs is discussed and then it is shown that the answer substitutions computed by such a logic program correspond to the extensions of the original default theory.

Recommendations

• scientific article; zbMATH DE number 516983
• scientific article; zbMATH DE number 980413
• scientific article; zbMATH DE number 1292289
• Operational concepts of nonmonotonic logics. I: Default logic
• scientific article; zbMATH DE number 124281

Cited in

(12)

• Consistency properties and set based logic programming
• Operational characterization of extensions in some logics for default reasoning
• scientific article; zbMATH DE number 4164124 (Why is no real title available?)
• Realizing Default Logic over Description Logic Knowledge Bases
• scientific article; zbMATH DE number 1292289 (Why is no real title available?)
• scientific article; zbMATH DE number 516983 (Why is no real title available?)
• scientific article; zbMATH DE number 980413 (Why is no real title available?)
• scientific article; zbMATH DE number 2079775 (Why is no real title available?)
• \textsf{dl2asp}: implementing default logic via answer set programming
• A system for computing constrained default logic extensions
• Compiling a default reasoning system into Prolog
• On the complexity of extension checking in default logic

This page was built for publication: A correct logic programming computation of default logic extensions

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