White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

The Complexity of Reasoning for Fragments of Default Logic

Beyersdorff, O, Meier, A, Thomas, M and Vollmer, H (2009) The Complexity of Reasoning for Fragments of Default Logic. In: Theory and Applications of Satisfiability Testing 2009. 12th International Conference, SAT 2009, 30 June - 03 July 2009, Swansea. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 51 - 64 . ISBN 978-3-642-02776-5

Available under licence : See the attached licence file.

Download (416Kb)
Item Type: Proceedings Paper
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
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: 07 Dec 2012 13:10
Last Modified: 07 Jun 2014 13:04
Published Version: http://dx.doi.org/10.1007/978-3-642-02777-2_7
Status: Published
Publisher: Springer Verlag
Identification Number: 10.1007/978-3-642-02777-2_7
URI: http://eprints.whiterose.ac.uk/id/eprint/74809

Actions (repository staff only: login required)