We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A Astructure can be considered as a A-term up to...
Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu...
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...
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Within the framework of continuous and multiresources cumulative constraints, a task T expresses a piecewise linear resource function and is represented by a sequence of p contigu...