Local Symmetry Breaking During Search in CSPs

DOI10.1007/978-3-540-74970-7_16zbMath1145.68505OpenAlexW1572453569MaRDI 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

Mathematics Subject Classification ID

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

Related Items (1)

Local and global symmetry breaking in itemset mining

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local Symmetry Breaking During Search in CSPs