Leveraging dominators for preprocessing QBF

Authors:
Hratch Mangassarian;Bao Le;Alexandra Goultiaeva;Andreas Veneris;Fahiem Bacchus
Affiliations:
University of Toronto, Toronto, ON;University of Toronto, Toronto, ON;University of Toronto, Toronto, ON;University of Toronto, Toronto, ON;University of Toronto, Toronto, ON
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2010

Citing 19
Cited 1

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
A topological search algorithm for ATPG

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Managing Don't Cares in Boolean Satisfiability

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Finding dominators revisited: extended abstract

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SAT sweeping with local observability don't-cares

Proceedings of the 43rd annual Design Automation Conference
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A solver for QBFs in negation normal form

Constraints
Beyond CNF: A Circuit-Based QBF Solver

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Solving QBF with combined conjunctive and disjunctive normal form

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Dynamically partitioning for solving QBF

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Preprocessing QBF

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Bounded model checking with QBF

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
sKizzo: a suite to evaluate and certify QBFs

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Solving quantified boolean formulas with circuit observability don't cares

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
QBF modeling: exploiting player symmetry for simplicity and efficiency

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Quantifier Structure in Search-Based Procedures for QBFs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Blocked clause elimination for QBF

CADE'11 Proceedings of the 23rd international conference on Automated deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuit-based information that is lost during the translation to Conjunctive Normal Form (CNF), the format accepted by most modern solvers. In this work, a novel preprocessing framework for circuit-based QBF problems is presented. It leverages structural circuit dominators to reduce the problem size and expedite the solving process. Our circuit-based QBF preprocessor PReDom recursively reduces dominated subcircuits to return a simpler but equisatisfiable QBF instance. A rigorous proof is given for eliminating subcircuits dominated by single outputs, irrespective of input quantifiers. Experimental results are presented for circuit diameter computation problems. With preprocessing times of at most five seconds using PReDom, three state-of-the-art QBF solvers can solve 27% to 45% of our problem instances, compared to none without preprocessing.