10 search results - page 1 / 2 » Complete Propagation Rules for Lexicographic Order Constrain... |
CSCLP
2005
Springer
13 years 10 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...
WINE
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...
CONSTRAINTS
2010
13 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
ESOP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
CONSTRAINTS
2011
12 years 11 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...