Algebraic Simplification Techniques for Propositional Satisfiability

@inproceedings{MarquesSilva2000AlgebraicST,
  title={Algebraic Simplification Techniques for Propositional Satisfiability},
  author={Joao Marques-Silva},
  booktitle={CP},
  year={2000}
}
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… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS

3 Figures & Tables

Topics

Statistics

051015'99'01'03'05'07'09'11'13'15'17
Citations per Year

59 Citations

Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.