39 citations · 161 across the 21 of their papers we have counts for
5 papers · 1 filter
Breaking Symmetries in Graph Search with Canonizing Sets
Avraham Itzhakov, Michael Codish
There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of th…
Computing the Ramsey Number R(4,3,3) using Abstraction and Symmetry breaking
Michael Codish, Michael Frank, Avraham Itzhakov +1
The number is often presented as the unknown Ramsey number with the best chances of being found "soon". Yet, its precise value has remained unknown for almost 50 years.…
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…
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…
Boolean Equi-propagation for Optimized SAT Encoding
Amit Metodi, Michael Codish, Vitaly Lagoon +1
We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literal…