The complexity of theorem proving in circumscription and minimal entailment

Beyersdorff, O orcid.org/0000-0002-2870-1648 and Chew, L (2014) The complexity of theorem proving in circumscription and minimal entailment. In: Demri, S, Kapur, D and Weidenbach, C, (eds.) Automated Reasoning 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. 7th International Joint Conference, IJCAR 2014, 19-22 Jul 2014, Vienna, Austria. Lecture Notes in Computer Science , 8562 L . Springer , pp. 403-417. ISBN 978-3-319-08586-9

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Demri, S
  • Kapur, D
  • Weidenbach, C
Copyright, Publisher and Additional Information:

© 2014, Springer. This is an author produced version of a paper published in Automated Reasoning 7th International Joint Conference (Lecture notes in computer science). 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-319-08587-6_32
Dates:
  • Published: 4 August 2014
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 16 Oct 2014 09:49
Last Modified: 12 Apr 2019 14:32
Published Version: http://dx.doi.org/10.1007/978-3-319-08587-6_32
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Refereed: Yes
Identification Number: 10.1007/978-3-319-08587-6_32
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)