Shortening QBF Proofs with Dependency Schemes

Blinkhorn, J and Beyersdorff, O orcid.org/0000-0002-2870-1648 (2017) Shortening QBF Proofs with Dependency Schemes. In: Theory and Applications of Satisfiability Testing – SAT 2017 (Lecture Notes in Computer Science). International Conference on Theory and Applications of Satisfiability Testing, 28 Aug - 01 Sep 2017, Melbourne, Australia. Springer Nature, pp. 263-280. ISBN: 978-3-319-66262-6 ISSN: 0302-9743 EISSN: UNSPECIFIED

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Springer International Publishing AG 2017. This is an author produced version of a paper published in Theory and Applications of Satisfiability Testing – SAT 2017 (Lecture Notes in Computer Science). Uploaded in accordance with the publisher's self-archiving policy. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-66263-3_17.
Dates:
  • Accepted: 15 June 2017
  • Published (online): 9 August 2017
  • Published: 9 August 2017
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: 03 Jul 2017 11:19
Last Modified: 20 Jan 2018 01:20
Status: Published
Publisher: Springer Nature
Identification Number: 10.1007/978-3-319-66263-3_17
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)