A correct logic programming computation of default logic extensions

DOI10.1023/A:1005771523328zbMATH Open0871.03003OpenAlexW1575064115MaRDI QIDQ679244FDOQ679244

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

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 Keywords

implementationlogic programmingdefault logicSLDNF-resolution

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Compiling a default reasoning system into Prolog
• A system for computing constrained default logic extensions
• On the complexity of extension checking in default logic
• Operational characterization of extensions in some logics for default reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Consistency properties and set based logic programming
• Realizing Default Logic over Description Logic Knowledge Bases
• \textsf{dl2asp}: implementing default logic via answer set programming

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)