Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2015) Feasible interpolation for QBF resolution calculi. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15). 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 06-10 Jul 2015, Kyoto, Japan. Springer Verlag , pp. 180-192.
Abstract
In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. We establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or expansion-based solving. This both provides the rst general lower bound method for QBF calculi 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: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Dates: |
|
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: | 05 May 2015 14:19 |
Last Modified: | 11 Apr 2017 09:12 |
Status: | Published |
Publisher: | Springer Verlag |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:85648 |