The complexity of theorem proving in autoepistemic logic

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, 8-12 July 2013, Helsinki, Finland. Springer , 365 - 376.

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
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:
  • Published: 2013
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (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: 21 Apr 2015 22:36
Published Version: http://dx.doi.org/10.1007/978-3-642-39071-5_27
Status: Published
Publisher: Springer
Identification Number: https://doi.org/10.1007/978-3-642-39071-5_27

Share / Export

Statistics