Abstract
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an operation preserving the constraints. To reflect these two views, we define solution symmetry and constraint symmetry. We discuss how these concepts are related and show that some CSP instances have many more solution symmetries than constraint symmetries.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 |
| Pages | 1589-1592 |
| Number of pages | 4 |
| Volume | 2 |
| Publication status | Published - 13 Nov 2006 |
| Event | 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 - Boston, MA, United States Duration: 16 Jul 2006 → 20 Jul 2006 |
Conference
| Conference | 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 |
|---|---|
| Country/Territory | United States |
| City | Boston, MA |
| Period | 16/07/06 → 20/07/06 |