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.
|Name||Lecture Notes in Computer Science|
|Conference||The 7th International Conference on Theory and Applications of Satisfiability Testing, Vancouver, BC, Canada|
|Period||10/05/04 → 13/05/04|
- Wiskunde en Informatica
- technische Wiskunde en Informatica
- conference contrib. refereed
- ZX CWTS JFIS < 1.00