2010/04/15 by Marijn Heule, Marijn J. H. Heule, Heule, Marijn +2
Computer Science · #Advanced Graph Theory Research #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #I.2.4 #cs.AI
paper · pdf · doi:10.48550/arxiv.1004.2624
AAAI 2010, Proceedings of Twenty-Fourth AAAI Conference on Artificial Intelligence
arxiv created 2010/04/15 · openalex publication_date 2010/04/15 · arxiv updated 2010/04/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.