Reformulation of global constraints based on constraints checkers
From MaRDI portal
Publication:850448
DOI10.1007/s10601-005-2809-xzbMath1103.68804OpenAlexW2147035284MaRDI QIDQ850448
Romuald Debruyne, Mats Carlsson, Thierry Petit, Nicolas Beldiceanu
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-2809-x
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
Using finite transducers for describing and synthesising structural time-series constraints ⋮ Invariants for time-series constraints ⋮ Tractability-preserving transformations of global cost functions ⋮ Global constraint catalogue: past, present and future ⋮ Generating custom propagators for arbitrary constraints ⋮ When bounds consistency implies domain consistency for regular counting constraints ⋮ Optimal and efficient filtering algorithms for table constraints
Uses Software
Cites Work
- Tree clustering for constraint networks
- Using constraint metaknowledge to reduce arc consistency computation
- Mixed global constraints and inference in hybrid CLP--IP solvers
- Introducing global constraints in CHIP
- An optimal coarse-grained arc consistency algorithm
- On the Desirability of Acyclic Database Schemes
- Degrees of acyclicity for hypergraphs and relational database schemes
- Programming Languages and Systems
- Principles and Practice of Constraint Programming – CP 2004
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reformulation of global constraints based on constraints checkers
