A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Recovering and Exploiting Structural Knowledge from CNF Formulas
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
VLSID '07 Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Solving QBF with combined conjunctive and disjunctive normal form
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
Blocked clause elimination for QBF
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automatic extraction of functional dependencies
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
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
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
Bridging the gap between dual propagation and CNF-based QBF solving
Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
Quantified Boolean Formula (QBF) solvers that utilize non-CNF representations are able to reason dually about conflicts and solutions by accessing structural information contained in the non-CNF representation. This structure is not as easily accessed from a CNF representation, hence CNF based solvers are not able to perform the same kind of reasoning. Recent work has shown how this additional structure can be extracted from a non-CNF representation and encoded in a form that can be fed directly to a CNF-based QBF solver without requiring major changes to the solver's architecture. This combines the benefits of specialized CNF-based techniques and dual reasoning. This approach, however, only works if one has access to a non-CNF representation of the problem, which is often not the case in practice. In this paper we address this problem and show how working only with the CNF encoding we can successfully extract partial structural information in a form that can be soundly given to a CNF-based solver. This yields performance benefits even though the information extracted is incomplete, and allows CNF-based solvers to obtain some of the benefits of dual reasoning in a more general context. To further increase the applicability of our approach we develop a new method for extracting structure from a CNF generated with the commonly used Plaisted-Greenbaum transformation.