@inproceedings{0f8c7a4278624ef08cf6833826f53526,
title = "Breaking symmetries with lex implications",
abstract = "Breaking symmetries is crucial when solving hard combinatorial problems. A common way to eliminate symmetries in CP/SAT is to add symmetry breaking constraints. Ideally, symmetry breaking constraints should be complete and compact. The aim of this paper is to find compact and complete symmetry breaks applicable when solving hard combinatorial problems using CP/SAT approach. In particular: graph search problems and matrix model problems where symmetry breaks are often specified in terms of lex constraints. We show that sets of lex constraints can be expressed with only a small portion of their inner lex implications which are a particular form of Horn clauses. We exploit this fact and compute a compact encoding of the row-wise LexLeader and state of the art partial symmetry breaking constraints. We illustrate the approach for graph search problems and matrix model problems.",
author = "Michael Codish and Thorsten Ehlers and Graeme Gange and Avraham Itzhakov and Stuckey, {Peter J.}",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 14th International Symposium on Functional and Logic Programming, FLOPS 2018 ; Conference date: 09-05-2018 Through 11-05-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-319-90686-7_12",
language = "English",
isbn = "9783319906850",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "182--197",
editor = "Gallagher, {John P.} and Martin Sulzmann and Gallagher, {John P.}",
booktitle = "Functional and Logic Programming - 14th International Symposium, FLOPS 2018, Proceedings",
address = "Germany",
}