Symmetry in Solutions

Abstract

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.

Cite

Text

Heule and Walsh. "Symmetry in Solutions." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7549

Markdown

[Heule and Walsh. "Symmetry in Solutions." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/heule2010aaai-symmetry/) doi:10.1609/AAAI.V24I1.7549

BibTeX

@inproceedings{heule2010aaai-symmetry,
  title     = {{Symmetry in Solutions}},
  author    = {Heule, Marijn and Walsh, Toby},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2010},
  pages     = {77-82},
  doi       = {10.1609/AAAI.V24I1.7549},
  url       = {https://mlanthology.org/aaai/2010/heule2010aaai-symmetry/}
}