Efficient CNF Simplification Based on Binary Implication Graphs

Marijn Heule, Matti Järvisalo, Armin Biere. Efficient CNF Simplification Based on Binary Implication Graphs. In Karem A. Sakallah, Laurent Simon, editors, Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings. Volume 6695 of Lecture Notes in Computer Science, pages 201-215, Springer, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.