Symmetry Breaking with Polynomial Delay

12/27/2010
by   Tim Januschowski, et al.
0

A conservative class of constraint satisfaction problems CSPs is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of CSPs are conservative. It is well known that lexleader constraints may significantly reduce the number of solutions by excluding symmetric solutions of CSPs. We show that adding certain lexleader constraints to any instance of any conservative class of CSPs still allows us to find all solutions with a time which is polynomial between successive solutions. The time is polynomial in the total size of the instance and the additional lexleader constraints. It is well known that for complete symmetry breaking one may need an exponential number of lexleader constraints. However, in practice, the number of additional lexleader constraints is typically polynomial number in the size of the instance. For polynomially many lexleader constraints, we may in general not have complete symmetry breaking but polynomially many lexleader constraints may provide practically useful symmetry breaking -- and they sometimes exclude super-exponentially many solutions. We prove that for any instance from a conservative class, the time between finding successive solutions of the instance with polynomially many additional lexleader constraints is polynomial even in the size of the instance without lexleaderconstraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2010

Symmetries of Symmetry Breaking Constraints

Symmetry is an important feature of many constraint programs. We show th...
research
11/25/2015

Breaking Symmetries in Graph Search with Canonizing Sets

There are many complex combinatorial problems which involve searching fo...
research
05/16/2020

On the Complexity of Breaking Symmetry

We can break symmetry by eliminating solutions within a symmetry class t...
research
09/28/2009

Breaking Generator Symmetry

Dealing with large numbers of symmetries is often problematic. One solut...
research
06/21/2013

Breaking Symmetry with Different Orderings

We can break symmetry by eliminating solutions within each symmetry clas...
research
12/22/2021

Lifting Symmetry Breaking Constraints with Inductive Logic Programming

Efficient omission of symmetric solution candidates is essential for com...
research
09/11/2011

Breaking Instance-Independent Symmetries In Exact Graph Coloring

Code optimization and high level synthesis can be posed as constraint sa...

Please sign up or login with your details

Forgot password? Click here to reset