Proof Complexity of Fragments of Long-Distance Q-Resolution

Q-resolution is perhaps the most well-studied proof system for Quantified Boolean Formulas (QBFs). Its proof complexity is by now well understood, and several general proof size lower bound techniques have been developed. The situation is quite different for long-distance Q-resolution (LDQ-resolution). While lower bounds on LDQ-resolution proof size have been established for specific families of formulas, we lack semantically grounded lower bound techniques for LDQ-resolution.

[1]  Armin Biere,et al.  Resolve and Expand , 2004, SAT.

[2]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..

[3]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[4]  Mikolás Janota,et al.  Expansion-based QBF solving versus Q-resolution , 2015, Theor. Comput. Sci..

[5]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[6]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[7]  Hans Kleine Büning,et al.  Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

[8]  Stefan Szeider,et al.  Dependency Learning for QBF , 2017, SAT.

[9]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[10]  Mikolás Janota,et al.  Proof Complexity of Resolution-based QBF Calculi , 2015, STACS.

[11]  Edmund M. Clarke,et al.  A Non-prenex, Non-clausal QBF Solver with Game-State Learning , 2010, SAT.

[12]  Markus N. Rabe,et al.  CAQE: A Certifying QBF Solver , 2015, 2015 Formal Methods in Computer-Aided Design (FMCAD).

[13]  Ronald L. Rivest,et al.  Learning decision lists , 2004, Machine Learning.

[14]  Mikolás Janota,et al.  On Q-Resolution and CDCL QBF Solving , 2016, SAT.

[15]  Jie-Hong Roland Jiang,et al.  Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..

[16]  Beate Bollig,et al.  A Very Simple Function that Requires Exponential Size Read-Once Branching Programs , 1998, Inf. Process. Lett..

[17]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean satisfiability solver , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[18]  Jie-Hong Roland Jiang,et al.  QBF Resolution Systems and Their Proof Complexities , 2014, SAT.

[19]  Mikolás Janota,et al.  Solving QBF with Counterexample Guided Refinement , 2012, SAT.

[20]  Jussi Rintanen.  Planning and SAT , 2009, Handbook of Satisfiability.

[21]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.

[22]  Mikolás Janota,et al.  On Conflicts and Strategies in QBF , 2015, LPAR.

[23]  Mikolás Janota,et al.  Solving QBF by Clause Selection , 2015, IJCAI.

[24]  Armando Tacchella,et al.  Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..

[25]  Leroy Chew.  QBF proof complexity , 2017 .

[26]  Meena Mahajan,et al.  Building Strategies into QBF Proofs , 2020, Journal of Automated Reasoning.

[27]  Olaf Beyersdorff,et al.  Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs , 2018, ITCS.

[28]  Mikolás Janota,et al.  Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs , 2015, AAAI.

[29]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

[30]  Allen Van Gelder.  Contributions to the Theory of Practical Quantified Boolean Formula Solving , 2012, CP.

[31]  Sharad Malik,et al.  Boolean Satisfiability Solvers and Their Applications in Model Checking , 2015, Proceedings of the IEEE.

[32]  Florian Lonsing,et al.  Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving , 2013, LPAR.

[33]  Leander Tentrup.  Non-prenex QBF Solving Using Abstraction , 2016, SAT.

[34]  Florian Lonsing,et al.  Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation , 2013, SAT.