In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
During software development, architecture decisions should be documented so that quality attributes guaranteed by these decisions and required in the software specification could ...
: An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] [a, b...