Nenofex: expanding NNF for QBF solving

Authors:
Florian Lonsing;Armin Biere
Affiliations:
Johannes Kepler University;Johannes Kepler University
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 29
Cited 14

A Structure-preserving Clause Form Translation

Journal of Symbolic Computation
An optimality result for clause form translation

Journal of Symbolic Computation
Resolution for quantified Boolean formulas

Information and Computation
An algorithm to evaluate quantified Boolean formulae

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Decomposable negation normal form

Journal of the ACM (JACM)
Reasoning in Boolean Networks: Logic Synthesis and Verification Using Testing Techniques

Reasoning in Boolean Networks: Logic Synthesis and Verification Using Testing Techniques
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
Learning for quantified boolean logic satisfiability

Eighteenth national conference on Artificial intelligence
DAG-aware circuit compression for formal verification

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Quantifier structure in search based procedures for QBFs

Proceedings of the conference on Design, automation and test in Europe: Proceedings
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
Solving QBF with combined conjunctive and disjunctive normal form

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
Backdoor sets of quantified boolean formulas

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Bounded universal expansion for preprocessing QBF

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
QBF reasoning on real-world instances

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
Quantifier trees for QBFs

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
Robust Boolean reasoning for equivalence checking and functional property verification

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

Variable Dependencies of Quantified CSPs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Unified Framework for Certificate and Compilation for QBF

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Leveraging dominators for preprocessing QBF

Proceedings of the Conference on Design, Automation and Test in Europe
Exploiting structure in an AIG based QBF solver

Proceedings of the Conference on Design, Automation and Test in Europe
Failed literal detection for QBF

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Blocked clause elimination for QBF

CADE'11 Proceedings of the 23rd international conference on Automated deduction
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
The seventh QBF solvers evaluation (QBFEVAL’10)

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Exploiting circuit representations in QBF solving

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Parallel QBF Solving with Advanced Knowledge Sharing

Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Solving QBF with counterexample guided refinement

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
On propositional QBF expansions and q-resolution

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The topic of this paper is Nenofex, a solver for quantified boolean formulae (QBF) in negation normal form (NNF), which relies on expansion as the core technique for eliminating variables. In contrast to eliminating existentially quantified variables by resolution on CNF, which causes the formula size to increase quadratically in the worst case, expansion on NNF is involved with only a linear increase of the formula size. This property motivates the use of NNF instead of CNF combined with expansion. In Nenofex, a formula in NNF is represented as a tree with structural restrictions in order to keep its size small and distances from nodes to the root short. Expansions of variables are scheduled based on estimated expansion cost. The variable with the smallest estimated cost is expanded first. In order to remove redundancy from the formula, limited versions of two approaches from the domain of circuit optimization have been integrated. Experimental results on latest benchmarks show that Nenofex indeed exceeds a given memory limit less frequently than a resolution-based QBF solver for CNF, but also that there is the need for runtime-related improvements.