Algebraic Simplification Techniques for Propositional Satisfiability
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instance. This ability can actually be essential for specific and hard classes of instances. The objective of this paper is to propose new simplification techniques for Conjunctive Normal Form (CNF) formulas. Experimental results, obtained on representative problem instances, indicate that large simplifications can be observed.
Unable to display preview. Download preview PDF.
- 1.J. F. Groote and J. P. Warners. The propositional formula checker heerhugo. Technical Report SEN-R9905, CWI, January 1999.Google Scholar
- 2.C.-M. Li. Integrating equivalency reasoning into davis-putnam procedure. In Proceedings of the National Conference on Artificial Intelligence, August 2000. Accepted for publication.Google Scholar
- 3.J. P. Marques-Silva. Algebraic simplification techniques for propositional satisfiability. Technical Report RT/01/2000, INESC, March 2000.Google Scholar
- 4.G. Stålmarck. A system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula, 1989. Swedish Patent 467 076 (Approved 1992), US Patent 5 276 897 (approved 1994), European Patent 0 403 454 (approved 1995).Google Scholar