Reasoning by Dominance in Not-Equals Binary Constraint Networks

DOI10.1007/11889205_48zbMath1160.68538OpenAlexW1782705229MaRDI QIDQ3524267

Mohamed Saïdi, Belaïd Benhamou

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_48

Mathematics Subject Classification ID

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

Related Items (1)

Local Symmetry Breaking During Search in CSPs

This page was built for publication: Reasoning by Dominance in Not-Equals Binary Constraint Networks