Alembic: An Efficient Algorithm for CNF Preprocessing

@article{Han2007AlembicAE,
  title={Alembic: An Efficient Algorithm for CNF Preprocessing},
  author={HyoJung Han and Fabio Somenzi},
  journal={2007 44th ACM/IEEE Design Automation Conference},
  year={2007},
  pages={582-587}
}
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or partial resolution may be applied. Preprocessing aims at simplifying the formula and at increasing the deductive power of the solver. These two objectives are sometimes competing. We present a new algorithm that combines simplification and increase of deductive power and we show its effectiveness in speeding up SAT… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
20 Extracted Citations
2 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…