714 search results - page 1 / 143 » Lexicographically-ordered constraint satisfaction problems |
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
CONSTRAINTS
2010
13 years 5 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...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
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...
AI
2006
Springer
13 years 5 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...