Symmetry definitions for constraint satisfaction problems
From MaRDI portal
Publication:850464
DOI10.1007/s10601-006-8059-8zbMath1103.68809MaRDI QIDQ850464
Barbara M. Smith, Christopher Jefferson, Karen E. Petrie, Peter G. Jeavons, David A. Cohen
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:b0cd60ab-e27e-4f18-9948-fb496af60cfd
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems, Hybrid Tractable Classes of Constraint Problems, Power of pre-processing: production scheduling with variable energy pricing and power-saving states, Computer-aided proof of Erdős discrepancy properties, Variable symmetry breaking in numerical constraint problems, A constraint-based approach to enigma 1225, The monoids of orders eight, nine \& ten., Pairwise symmetry reasoning for multi-agent path finding search, Lifting symmetry breaking constraints with inductive logic programming, Constraint models for graceful graphs, Speeding up operations on feature terms using constraint programming and variable symmetry, On the hardness of solving edge matching puzzles as SAT or CSP problems, Lightweight dynamic symmetry breaking, Symmetries, almost symmetries, and lazy clause generation, A method for detecting symmetries in constraint models and its generalisation, Generating custom propagators for arbitrary constraints, Symmetry Breaking Constraints for the Minimum Deficiency Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic Detection of Variable and Value Symmetries
- Recent Advances in Constraints
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Exploiting symmetries within constraint satisfaction search
