Download PDFOpen PDF in browserCompact Partial Symmetry Breaking for Graph Search Problems17 pages•Published: October 23, 2026AbstractSymmetry breaking in graph search problems remains challenging: complete symmetry breaking constraints are typically exponential in size, while partial approaches trade pruning strength for scalability.We introduce a strength-driven, redundancy-aware methodology for constructing compact partial symmetry breaking constraints based on graph patterns. Each pattern corresponds to a simple clause over equality literals and can be integrated directly into CP or SAT models. Our approach incrementally selects strong, non-redundant patterns, yielding partial symmetry breaks that achieve substantial pruning while remaining compact. This provides a principled framework for deriving lightweight symmetry breaking constraints beyond previously studied constructions. We evaluate the proposed constraints on graph instances with up to 25 vertices using a redundancy ratio metric. The resulting partial symmetry breaks constitute only a small fraction of the size of complete symmetry breaking constraints, while delivering significant performance improvements across several graph search benchmarks compared to previously defined partial symmetry breaking methods. Keyphrases: cegar, graph symmetry, ramsey graphs In: Erika Ábrahám, Nikolaj Bjørner and Michael Rawson (editors). Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol 112, pages 401-417.
|
