Proof complexity of propositional default logic

DOI10.1007/S00153-011-0245-8zbMATH Open1308.03057OpenAlexW1965803162WikidataQ57998311 ScholiaQ57998311MaRDI QIDQ647339FDOQ647339

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/

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

zbMATH Keywords

proof complexitysequent calculusdefault logic

Mathematics Subject Classification ID

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

Cites Work

• Nonmonotonic reasoning, preferential models and cumulative logics
• Title not available (Why is that?)
• The relative efficiency of propositional proof systems
• A logic for default reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• On lengths of proofs in non-classical logics
• Substitution Frege and extended Frege proof systems in non-classical logics
• Frege systems for extensible modal logics
• On Interpolation and Automatization for Frege Systems
• Complexity Results for Nonmonotonic Logics
• Title not available (Why is that?)
• Tableau-based characterization and theorem proving for default logic
• Nonmonotonic reasoning: Towards efficient calculi and implementations
• Proof-complexity results for nonmonotonic reasoning
• A survey of complexity results for non-monotonic logics
• Title not available (Why is that?)
• A proof theoretical approach to default reasoning I: tableaux for default logic
• Proof complexity of propositional default logic
• Title not available (Why is that?)

Cited In (12)

• Proof complexity of modal resolution
• Strong backdoors for default logic
• On the complexity of extension checking in default logic
• Proof complexity of non-classical logics
• Title not available (Why is that?)
• Strong backdoors for default logic
• Sequent-type rejection systems for finite-valued non-deterministic logics
• Restricted default theories: expressive power and outlier detection tasks
• Proof complexity of propositional default logic
• Proof Complexity of Non-classical Logics
• A sequent calculus for skeptical reasoning in predicate default logic (extended abstract)
• The complexity of theorem proving in autoepistemic 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)