Local Symmetry Breaking During Search in CSPs
From MaRDI portal
Publication:3523057
DOI10.1007/978-3-540-74970-7_16zbMath1145.68505MaRDI QIDQ3523057
Mohamed Saïdi, Belaïd Benhamou
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_16
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short proofs for tricky formulas
- Tractability through symmetries in propositional calculus
- Symmetry Definitions for Constraint Satisfaction Problems
- Conditional Symmetry Breaking
- Breaking All Value Symmetries in Surjection Problems
- Dynamic Lex Constraints
- General Symmetry Breaking Constraints
- Reasoning by Dominance in Not-Equals Binary Constraint Networks