Proof complexity of propositional default logic

DOI10.1007/978-3-642-14186-7_5MaRDI QIDQ4930577zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2010/2526/

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Complexity of proofs (03F20)

Recommendations

• Proof complexity of propositional default logic
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• The complexity of theorem proving in autoepistemic logic
• A sequent calculus for skeptical Default Logic
• Sequent calculi for default and autoepistemic logics

Cited in

(7)

• The complexity of theorem proving in autoepistemic logic
• A sequent-type calculus for three-valued default logic, or: Tweety meets quartum non datur
• On the complexity of extension checking in default logic
• scientific article; zbMATH DE number 1123617 (Why is no real title available?)
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Proof complexity of propositional default logic
• Proof Complexity of Non-classical Logics

This page was built for publication: Proof complexity of propositional default logic

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