Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints

DOI10.1016/j.artint.2009.03.001zbMath1186.68432OpenAlexW2035467951MaRDI QIDQ840817

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

Publication date: 14 September 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2009.03.001

zbMATH Keywords

decompositionsconstraint satisfactionconstraint programmingglobal constraintsopen global constraints

Mathematics Subject Classification ID

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

Related Items

Guarantees and limits of preprocessing in constraint satisfaction and reasoning

Uses Software

• CPLEX
• Choco

Cites Work

• Filtering algorithms for the NValue constraint
• A generic arc-consistency algorithm and its specializations
• Increasing constraint propagation by redundant modeling: An experience report
• Introducing global constraints in CHIP
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The complexity of reasoning with global constraints
• An empirical study of phase transitions in binary constraint satisfaction problems
• Filtering Algorithms for the NValue Constraint
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item