Understanding Cutting Planes for QBFs

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2016) Understanding Cutting Planes for QBFs. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 13-15 Dec 2016, Chennai, India. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing , pp. 1-15.

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Anil Shukla; licensed under Creative Commons License CC-BY.
Keywords: proof complexity; QBF; cutting planes; resolution; simulations
Dates:
  • Published: December 2016
  • Accepted: 16 September 2016
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)
Funding Information:
FunderGrant number
EPSRCEP/L024233/1
John Templeton Foundation - DO NOT USE48138
EU - European Union612638
Depositing User: Symplectic Publications
Date Deposited: 05 Dec 2016 12:01
Last Modified: 05 Oct 2017 15:40
Published Version: http://doi.org/10.4230/LIPIcs.FSTTCS.2016
Status: Published
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing
Identification Number: https://doi.org/10.4230/LIPIcs.FSTTCS.2016

Share / Export

Statistics