Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900288
DOI10.1007/b100482zbMath1152.68539OpenAlexW1508891358MaRDI QIDQ5900288
Mats Carlsson, Thierry Petit, Nicolas Beldiceanu
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
Invariants for time-series constraints ⋮ Reformulation of global constraints based on constraints checkers ⋮ Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ Global constraint catalogue: past, present and future ⋮ Boolean-arithmetic equations: acquisition and uses ⋮ Deriving generic bounds for time-series constraints based on regular expressions characteristics ⋮ Bounds of graph parameters for global constraints ⋮ Grammar constraints ⋮ On global warming: Flow-based soft global constraints ⋮ When bounds consistency implies domain consistency for regular counting constraints ⋮ On the reification of global constraints ⋮ On matrices, automata, and double counting in constraint programming
Uses Software
This page was built for publication: Principles and Practice of Constraint Programming – CP 2004
