2864 search results - page 140 / 573 » Constraint Programming in OPL |
CP
2008
Springer
13 years 11 months ago
2008
Springer
We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition ...
TOPLAS
2008
13 years 9 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
CP
2009
Springer
14 years 9 months ago
2009
Springer
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...