On the complexity of extension checking in default logic

DOI10.1016/J.IPL.2005.12.005zbMATH Open1187.68584OpenAlexW2042523249MaRDI QIDQ844157FDOQ844157

Authors Paolo Liberatore

Publication date 18 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.12.005

zbMATH Keywords

computational complexityknowledge representationdefault logic

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 1876863
• scientific article; zbMATH DE number 516983
• A correct logic programming computation of default logic extensions
• Propositional default logics made easier: computational complexity of model checking.
• On extensibility of proof checkers
• scientific article; zbMATH DE number 124281
• The complexity of reasoning for fragments of default logic
• The Complexity of Reasoning for Fragments of Default Logic
• Proof complexity of propositional default logic
• Proof complexity of propositional default logic

Cites work

• scientific article; zbMATH DE number 1292298 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• A logic for default reasoning
• Alternative approaches to default logic
• Operational concepts of nonmonotonic logics. I: Default logic
• Propositional default logics made easier: computational complexity of model checking.

Cited in

(4)

• scientific article; zbMATH DE number 1123617 (Why is no real title available?)
• Redundancy in logic. III: Non-monotonic reasoning
• On extensibility of proof checkers
• A system for computing constrained default logic extensions

This page was built for publication: On the complexity of extension checking in default logic

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