Proof Complexity of Propositional Default Logic

Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2010) Proof Complexity of Propositional Default Logic. In: Strichman, O and Szeider, S, (eds.) Theory and applications of satisfiability testing. SAT 2010, 11-14 July 2010, Edinburgh, UK. Lecture notes in computer science, 6175 . Springer Verlag , 30 - 43 . ISBN 978-3-642-14185-0

Abstract

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Meier, A
  • Mueller, S
  • Thomas, M
  • Vollmer, H
Copyright, Publisher and Additional Information: © 2010, 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: 2010
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: 13 Dec 2012 12:17
Last Modified: 02 Nov 2016 05:00
Published Version: http://dx.doi.org/10.1007/978-3-642-14186-7_5
Status: Published
Publisher: Springer Verlag
Series Name: Lecture notes in computer science
Identification Number: https://doi.org/10.1007/978-3-642-14186-7_5

Share / Export

Statistics