39 citations · 161 across the 21 of their papers we have counts for
Showing 2014 · cs.AIShow all
2 papers · 2 filters
cs.AI2014★ 2 cited
Solving Graph Coloring Problems with Abstraction and Symmetry
Michael Codish, Michael Frank, Avraham Itzhakov +1
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further…
cs.AI2014★ 24 cited
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
Amit Metodi, Michael Codish, Peter James Stuckey
We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate inf…