Dynamic structural symmetry breaking for constraint satisfaction problems

DOI10.1007/s10601-008-9059-7zbMath1186.68438WikidataQ57574259 ScholiaQ57574259MaRDI QIDQ1037643

Magnus Ågren, Pierre Flener, Pascal Van Hentenryck, Justin Pearson, Meinolf Sellmann

Publication date: 16 November 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9059-7

zbMATH Keywords

symmetry breaking; CSP; tractability; dominance detection

Mathematics Subject Classification ID

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

Related Items

Static and dynamic structural symmetry breaking, Dynamic structural symmetry breaking for constraint satisfaction problems, Towards breaking more composition symmetries in partial symmetry breaking, Lightweight dynamic symmetry breaking, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem

Uses Software

• OPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetry breaking constraints for value symmetries in constraint satisfaction
• Static and dynamic structural symmetry breaking
• Dynamic structural symmetry breaking for constraint satisfaction problems
• Solving Kirkman's schoolgirl problem in a few seconds
• Cost-based filtering for shorter path constraints
• Constraint and Integer Programming in OPL
• Breaking Symmetry of Interchangeable Variables and Values
• Symmetry Definitions for Constraint Satisfaction Problems
• A Fast Algorithm for Generating Set Partitions
• Artificial Intelligence and Symbolic Computation
• Exploiting symmetries within constraint satisfaction search