Resolution for quantified Boolean formulas
Information and Computation
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
A non-prenex, non-clausal QBF solver with game-state learning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Integrating dependency schemes in search-based QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Computing resolution-path dependencies in linear time ,
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Contributions to the theory of practical quantified boolean formula solving
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Variable independence in quantified boolean formulas (QBFs) informally means that the quantifier structure of the formula can be rearranged so that two variables reverse their outer-inner relationship without changing the value of the QBF. Samer and Szeider introduced the standard dependency scheme and the triangle dependency scheme to safely over-approximate the set of variable pairs for which an outer-inner reversal might be unsound (JAR 2009). This paper introduces resolution paths and defines the resolution-path dependency relation. The resolution-path relation is shown to be the root (smallest) of a lattice of dependency relations that includes quadrangle dependencies, triangle dependencies, strict standard dependencies, and standard dependencies. Soundness is proved for resolution-path dependencies, thus proving soundness for all the descendants in the lattice. It is shown that the biconnected components (BCCs) and block trees of a certain clause-literal graph provide the key to computing dependency pairs efficiently for quadrangle dependencies. Preliminary empirical results on the 568 QBFEVAL-10 benchmarks show that in the outermost two quantifier blocks quadrangle dependency relations are smaller than standard dependency relations by widely varying factors.