Efficient CNF Simplification Based on Binary Implication Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Marijn Heule' in GoogleThis author has not been identified. Look up 'Matti Järvisalo' in GoogleThis author has not been identified. Look up 'Armin Biere' in Google

runs on WebDSL