Abstract
We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we developed a learning scheme that translates each encountered conflict into one conflict clause which covers equivalent conflicts arising from any permutation of the colors.
Our technique introduces new Boolean variables during the search. For many problems the size of the resolution refutation can be significantly reduced by this technique. Although this is shown for various hand-made refutations, it is rarely used in practice, because it is hard to determine which variables to introduce defining useful predicates. In case of graph coloring, the reason for each conflicting coloring can be expressed as a node in the Zykov-tree, that stems from merging some vertices and adding some edges. So, we focus on variables that represent the Boolean expression that two vertices can be merged (if set to true), or that an edge can be placed between them (if set to false). Further, our algorithm reduces the number of introduced variables by reusing them.
We implemented our technique in the state-of-the-art solver minisat. It is competitive with alternative SAT based techniques for graph coloring problems. Moreover, our technique can be used on top of other symmetry breaking techniques. In fact, combined with adding symmetry breaking predicates, huge performance gains are realized.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient Symmetry Breaking for Boolean Satisfiability. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 271–282 (2003)
Ansótegui, C., Larrubia, J., Li, C.M., Manyà, F.: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Annals of Mathematics and Artificial Intelligence 49(1-4), 191–205 (2007)
Cook, S.A.: A short proof of the pigeonhole principle using extended resolution. SIGACT News 8(4), 28–32 (1976)
Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proceedings of STOC 1975, pp. 83–97 (1975)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)
Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM 7(3), 201–215 (1960)
Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Gent, I.P.: Arc Consistency in SAT. In: Proceedings of the Fifteenth European Conference on Artificial Intelligence, ECAI 2002 (2002)
Gomes, C.P., Shmoys, D.B.: Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem. In: Proceedings of the Computational Symposium on Graph Coloring and Generalizations, Ithaca, USA, pp. 22–39 (2002)
Keur, A., Stevens, C., Voortman, M.: Symmetry Breaking Options in Conflict Driven SAT Solving. TU-delft technical report, http://www.st.ewi.tudelft.nl/sat/reports.php
Marques-Silva, J.P., Sakallah, K.A.: GRASP – a new search algorithm for satisfiability. In: International Conference on Computer-Aided Design, pp. 220–227 (1996)
Moskewicz, M.W., Madigan, C.F.: Chaff: engineering an efficient SAT solve. In: Proceedings of DAC 2001, pp. 530–535 (2001)
Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. Journal of Symbolic Computation 2(3), 293–304 (1986)
Prestwich, S.: Local Search on SAT-Encoded Colouring Problems. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 26–29. Springer, Heidelberg (2005)
Sakallah, K.A.: Symmetry and Satisfiability. In: Handbook of Satisfiability, ch. 10, pp. 289–338 (2009)
Sinz, C., Biere, A.: Extended Resolution Proofs for Conjoining BDDs. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 600–611. Springer, Heidelberg (2006)
Tseitin, G.: On the complexity of derivation in propositional calculus. In: Studies in Mathematics and Mathematical Logic, Part II, pp. 115–125 (1968)
Urquhart, A.: Hard examples for resolution. Journal of the ACM 34(1), 209–219 (1987)
Van Gelder, A.: Another look at graph coloring via propositional satisfiability. Discrete Applied Mathematics 156(2), 230–243 (2008)
Zykov, A.A.: On some properties of linear complexes. Amer. Math. Soc. Translations 79, 81 (1952)
Computational Series: Graph Coloring and Its Generalizations, http://mat.gsia.cmu.edu/COLOR04
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schaafsma, B., Heule, M.J.H., van Maaren, H. (2009). Dynamic Symmetry Breaking by Simulating Zykov Contraction. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-02777-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02776-5
Online ISBN: 978-3-642-02777-2
eBook Packages: Computer ScienceComputer Science (R0)