Sciweavers

Share
CP
2000
Springer

Algebraic Simplification Techniques for Propositional Satisfiability

9 years 11 months ago
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.
João P. Marques Silva
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where CP
Authors João P. Marques Silva
Comments (0)
books