Beyersdorff, O (2013) The complexity of theorem proving in autoepistemic logic. In: Järvisalo, M and Van Gelder, A, (eds.) Theory and Applications of Satisfiability Testing – SAT 2013, 16th International Conference, Proceedings. SAT 2013, 16th International Conference on Theory and Applications of Satisfiability Testing, 08-12 Jul 2013, Helsinki, Finland. Springer , 365 - 376.
Abstract
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.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | (c) 2013, Springer. This is an author produced version of a paper published in Theory and Applications of Satisfiability Testing – SAT 2013, 16th International Conference, Proceedings. Uploaded in accordance with the publisher's self-archiving policy. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39071-5_27 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 23 Jun 2014 11:08 |
Last Modified: | 19 Dec 2022 13:27 |
Published Version: | http://dx.doi.org/10.1007/978-3-642-39071-5_27 |
Status: | Published |
Publisher: | Springer |
Identification Number: | 10.1007/978-3-642-39071-5_27 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:79313 |