A Novel Approach For Detecting Symmetries in CSP Models

DOI10.1007/978-3-540-68155-7_14zbMath1142.68520OpenAlexW1555879612MaRDI QIDQ5387629

Maria Garcia de la Banda, Christopher Mears, Mark G. Wallace, Bart Demoen

Publication date: 27 May 2008

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems ⋮ Symmetry in Mathematical Programming ⋮ Lifting symmetry breaking constraints with inductive logic programming ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ Lightweight dynamic symmetry breaking ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ A method for detecting symmetries in constraint models and its generalisation

Cites Work

• On implementing symmetry detection
• Symmetry Definitions for Constraint Satisfaction Problems
• Automatic Detection of Variable and Value Symmetries
• General Symmetry Breaking Constraints
• Artificial Intelligence and Symbolic Computation
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item

This page was built for publication: A Novel Approach For Detecting Symmetries in CSP Models