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]
@inproceedings{HeuleJB11,
title = {Efficient CNF Simplification Based on Binary Implication Graphs},
author = {Marijn Heule and Matti Järvisalo and Armin Biere},
year = {2011},
doi = {10.1007/978-3-642-21581-0_17},
url = {http://dx.doi.org/10.1007/978-3-642-21581-0_17},
tags = {rule-based, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HeuleJB11},
cites = {0},
citedby = {0},
pages = {201-215},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings},
editor = {Karem A. Sakallah and Laurent Simon},
volume = {6695},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-21580-3},
}