Aligning CNF- and equivalence-reasoning

Authors:
Marijn Heule;Hans van Maaren
Affiliations:
Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology;Department of Information Systems and Algorithms, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology
Venue:
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Year:
2004

Citing 5
Cited 7

Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Recovering and Exploiting Structural Knowledge from CNF Formulas

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Equivalent literal propagation in the DLL procedure

Discrete Applied Mathematics - The renesse issue on satisfiability
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
A two-phase algorithm for solving a class of hard satisfiability problemsfn1fn1Supported by the Dutch Organization for Scientific Research (NWO) under grant SION 612-33-001.

Operations Research Letters

The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study

Journal of Algorithms
Present and Future of Practical SAT Solving

Complexity of Constraints
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Efficiently exploiting dependencies in local search for SAT

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
The language of search

Journal of Artificial Intelligence Research
Beyond unit propagation in SAT solving

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Classifying and propagating parity constraints

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translation to CNF. Probably the best known example of this is the parity-family. Large instances of such CNF formulas cannot be solved in reasonable time if no detection of, and extra reasoning with, these clauses is incorporated. That is, in solving these formulas, there is a more or less separate algorithmic device dealing with the equivalence clauses, called equivalence reasoning, and another dealing with the remaining clauses. In this paper we propose a way to align these two reasoning devices by introducing parameters for which we establish optimal values over a variety of existing benchmarks. We obtain a truly convincing speed-up in solving such formulas with respect to the best solving methods existing so far.