Semantical considerations on nonmonotonic logic
Artificial Intelligence
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Sequent calculi for propositional nonmonotonic logics
ACM Transactions on Computational Logic (TOCL)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Logical Foundations of Proof Complexity
Logical Foundations of Proof Complexity
Proof complexity of propositional default logic
Archive for Mathematical Logic
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
The complexity of reasoning for fragments of default logic1
Journal of Logic and Computation
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
Autoepistemic logic is one of the most successful formalisms for nonmonotonic reasoning. In this paper we provide a proof-theoretic analysis of sequent calculi for credulous and sceptical reasoning in propositional autoepistemic logic, introduced by Bonatti and Olivetti [5]. We show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen's system LK. Hence proving lower bounds for credulous reasoning will be as hard as proving lower bounds for LK. This contrasts with the situation in sceptical autoepistemic reasoning where we obtain an exponential lower bound to the proof length in Bonatti and Olivetti's calculus.