Breaking Symmetry of Interchangeable Variables and Values

DOI10.1007/978-3-540-74970-7_31zbMath1145.68521OpenAlexW1527604877MaRDI QIDQ3523071

Toby Walsh, J. Y. K. Yip, Yat Chiu Law, Jimmy Ho-man Lee

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_31

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Towards breaking more composition symmetries in partial symmetry breaking ⋮ Parameterized Complexity Results in Symmetry Breaking ⋮ Dynamic structural symmetry breaking for constraint satisfaction problems ⋮ Lightweight dynamic symmetry breaking ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ A method for detecting symmetries in constraint models and its generalisation

Cites Work

• Unnamed Item
• Symmetry breaking constraints for value symmetries in constraint satisfaction
• Propagation algorithms for lexicographic ordering constraints
• On the Desirability of Acyclic Database Schemes
• Automatic Detection of Variable and Value Symmetries
• Breaking All Value Symmetries in Surjection Problems
• Global Grammar Constraints
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Breaking Symmetry of Interchangeable Variables and Values