The Complexity of Reasoning for Fragments of Default Logic

Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The Complexity of Reasoning for Fragments of Default Logic. In: Theory and Applications of Satisfiability Testing 2009. 12th International Conference, SAT 2009, 30 Jun - 03 Jul 2009, Swansea. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag, 51 - 64 . ISBN: 978-3-642-02776-5 ISSN: 0302-9743 EISSN: UNSPECIFIED

Metadata

Item Type: Proceedings Paper
Authors/Creators:
  • Beyersdorff, O
  • Meier, A
  • Thomas, M
  • Vollmer, H
Copyright, Publisher and Additional Information:

© 2009, Springer Verlag. This is an author produced version of a paper published in Theory and Applications of Satisfiability Testing. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com

Dates:
  • Published: 2009
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: 07 Dec 2012 13:10
Last Modified: 19 Dec 2022 13:24
Published Version: http://dx.doi.org/10.1007/978-3-642-02777-2_7
Status: Published
Publisher: Springer Verlag
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-642-02777-2_7
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)