Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2017) Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science, 13 (2). 7. ISSN 1860-5974
Abstract
In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or expansion-based solving. This both provides the first general lower bound method for QBF proof systems as well as largely extends the scope of classical feasible interpolation. We apply our technique to obtain new exponential lower bounds to all resolution-based QBF systems for a new class of QBF formulas based on the clique problem. Finally, we show how feasible interpolation relates to the recently established lower bound method based on strategy extraction.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © O. Beyersdorff, L. Chew, M. Mahajan, and A. Shukla. This is an open access article under the terms of the Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0) License. |
Keywords: | Computer Science - Computational Complexity, Computer Science - Logic in Computer Science |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC EP/L024233/1 John Templeton Foundation - DO NOT USE 48138 EU - European Union 612638 |
Depositing User: | Symplectic Publications |
Date Deposited: | 31 Mar 2017 10:01 |
Last Modified: | 21 Feb 2024 14:30 |
Status: | Published |
Publisher: | IfCoLog (International Federation of Computational Logic) |
Identification Number: | 10.1007/978-3-662-47672-7_15 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:114393 |