Reasoning by Dominance in Not-Equals Binary Constraint Networks

DOI10.1007/11889205_48MaRDI QIDQ3524267zbMATH OpenOpenAlexFDO

Authors Belaïd Benhamou, Mohamed Saïdi

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)

Recommendations

• Dominance breaking constraints
• scientific article; zbMATH DE number 1822444
• Recent Advances in Constraints
• Domain filtering consistencies
• Exploiting symmetries within constraint satisfaction search

Cited in

(1)

• Local Symmetry Breaking During Search in CSPs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524267)