114 search results - page 3 / 23 » Implementing Propagators for Tabular Constraints |
AI
2010
Springer
13 years 5 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
CSCLP
2005
Springer
13 years 11 months ago
2005
Springer
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
MOZ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...