In The Art of Computer Programming, Knuth benchmarked 10 encoding techniques for computing the chromatic number of the queen's graph: the minimum number of colors needed to color the squares of an $n \times n$ chessboard so that no two squares sharing a row, column, or diagonal receive the same color. In this paper, we...
Bernardo Subercaseaux, Benjamin Przybocki, Marijn J. H. Heule· 0 citations
This paper presents a new algorithm that treats symmetry breaking not merely as a restriction mechanism, but as a simplification mechanism, which enables strong formula simplifications and substantially outperforms lex-leader and orbitopal fixing while producing compact proofs.
Markus Anders, Cayden R. Codel, Marijn J. H. Heule· International Conference on...· 1 citation
This paper revisits previous work on ER, which factors out repeated parts of learned clauses during conflict analysis, and explores how their original strategy benefits from 15 years of improvements in the state-of-the-art solver CaDiCaL, and proposes a new, less intrusive inprocessing approach based on factoring XOR a...
Florian Pollitt, Zachary Battleman, Mathias Fleury et al.· International Conference on...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
