Proof complexity of propositional default logic

DOI10.1007/s00153-011-0245-8zbMath1308.03057OpenAlexW1965803162WikidataQ57998311 ScholiaQ57998311MaRDI QIDQ647339

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

sequent calculusdefault logicproof complexity

Mathematics Subject Classification ID

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

Related Items (4)

Proof complexity of modal resolution ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On lengths of proofs in non-classical logics
• Substitution Frege and extended Frege proof systems in non-classical logics
• A logic for default reasoning
• Nonmonotonic reasoning, preferential models and cumulative logics
• Tableau-based characterization and theorem proving for default logic
• Frege systems for extensible modal logics
• Proof-complexity results for nonmonotonic reasoning
• Complexity Results for Nonmonotonic Logics
• The relative efficiency of propositional proof systems
• A survey of complexity results for non-monotonic logics
• On Interpolation and Automatization for Frege Systems
• A proof theoretical approach to default reasoning I: tableaux for default logic
• Proof Complexity of Propositional Default Logic

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