Proof complexity of propositional default logic

DOI10.1007/S00153-011-0245-8MaRDI QIDQ647339zbMATH OpenOpenAlexWikidataFDO

Authors Juan-Miguel Gracia

Publication date 23 November 2011

Published in Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

proof complexitysequent calculusdefault logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Complexity of proofs (03F20)

Recommendations

• Proof complexity of propositional default logic
• The Complexity of Reasoning for Fragments of Default Logic
• Axiomatization of credulous reasoning in rational default logic
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• Sequent calculi for default and autoepistemic logics
• On the computational complexity of assumption-based argumentation for default reasoning.
• A sequent calculus for skeptical Default Logic
• The complexity of theorem proving in autoepistemic logic
• Hard problems for simple default logics
• Publication:3493327

Cites work

• scientific article; zbMATH DE number 3930376 (Why is no real title available?)
• scientific article; zbMATH DE number 4104920 (Why is no real title available?)
• scientific article; zbMATH DE number 478394 (Why is no real title available?)
• scientific article; zbMATH DE number 806744 (Why is no real title available?)
• scientific article; zbMATH DE number 819737 (Why is no real title available?)
• scientific article; zbMATH DE number 5877692 (Why is no real title available?)
• A logic for default reasoning
• A proof theoretical approach to default reasoning I: tableaux for default logic
• A survey of complexity results for non-monotonic logics
• Complexity Results for Nonmonotonic Logics
• Frege systems for extensible modal logics
• Nonmonotonic reasoning, preferential models and cumulative logics
• Nonmonotonic reasoning: Towards efficient calculi and implementations
• On Interpolation and Automatization for Frege Systems
• On lengths of proofs in non-classical logics
• Proof complexity of propositional default logic
• Proof-complexity results for nonmonotonic reasoning
• Substitution Frege and extended Frege proof systems in non-classical logics
• Tableau-based characterization and theorem proving for default logic
• The relative efficiency of propositional proof systems

Cited in

(12)

• Proof complexity of propositional default logic
• Proof complexity of modal resolution
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• scientific article; zbMATH DE number 1123617 (Why is no real title available?)
• Proof complexity of non-classical logics
• On the complexity of extension checking in default logic
• The complexity of theorem proving in autoepistemic logic
• Sequent-type rejection systems for finite-valued non-deterministic logics
• Restricted default theories: expressive power and outlier detection tasks
• Proof Complexity of Non-classical Logics
• Strong backdoors for default logic
• Strong backdoors for default logic

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 Q647339)