The ROOTS Constraint

DOI10.1007/11889205_8MaRDI QIDQ3524236zbMATH OpenOpenAlexFDO

Authors Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh

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://hal-lirmm.ccsd.cnrs.fr/lirmm-00135537/file/cp06-roots.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• The complexity of reasoning with global constraints
• Fast bound consistency for the global cardinality constraint
• scientific article; zbMATH DE number 2084707

Cited in

(4)

• An optimal arc consistency algorithm for a particular case of sequence constraint
• Root-neededness and approximations of neededness
• STR2: optimized simple tabular reduction for table constraints
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Describes a project that uses

Uses Software

• Choco
• CSPLib

This page was built for publication: The ROOTS Constraint

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