Symmetry in Solutions
DOI:
https://doi.org/10.1609/aaai.v24i1.7549Keywords:
Symmetry, constraint programming, constraint satisfaction, graceful labelling, Van der WaerdenAbstract
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping between different solutions of the same problem. We argue that we may be able to exploit both types of symmetry when finding solutions. We illustrate the potential of exploiting internal symmetries on two benchmark domains: Van der Waerden numbers and graceful graphs. By identifying internal symmetries we are able to extend the state of the art in both cases.
Downloads
Published
2010-07-03
How to Cite
Heule, M., & Walsh, T. (2010). Symmetry in Solutions. Proceedings of the AAAI Conference on Artificial Intelligence, 24(1), 77-82. https://doi.org/10.1609/aaai.v24i1.7549
Issue
Section
Constraints, Satisfiability, and Search