Add to ORKGThis document introduces constraint programming in Oz. We restrict our attention to combinatorial problems that can be stated with variables ranging over finite sets of nonnegative integers. Problems in this class range from puzzles to real world applications as diverse as scheduling, ware house allocation, configuration and placement
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
This paper summarizes a constraint solving technique that can be used to reason effectively in the s...
Tutorial at CP'2002, Principles and Practice of Constraint Programming. Powerpoint slides.</p
We report on the extension of the concurrent constraint language Oz by constraints over finite sets ...
This paper describes the finite domain system embedded in Oz, a higher-order concurrent constraint l...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
We introduce branch and infer, a unifying framework for integer linear programming and finite domain...
We present a unifying framework for integer linear programming and finite domain constraint programm...
International audienceThe computer will be the most marvellous of all tools as soon as program writi...
International audienceCombinatorial problems involving sets and relations are currently tackled by i...
This paper introduces an instantiation of the constraint logic programming scheme called CLP(PolyFD)...
This paper summarizes a constraint solving technique that is used to reason effectively in the scope...
Existing libraries and languages for finite domain constraint programming have backtracking-based de...
We introduce branch-and-infer, a unifying framework for integer linear programming and finite domain...
Pseudo-Boolean constraints are a special form of finite domain constraints where all variables are d...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
This paper summarizes a constraint solving technique that can be used to reason effectively in the s...
Tutorial at CP'2002, Principles and Practice of Constraint Programming. Powerpoint slides.</p
We report on the extension of the concurrent constraint language Oz by constraints over finite sets ...
This paper describes the finite domain system embedded in Oz, a higher-order concurrent constraint l...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
We introduce branch and infer, a unifying framework for integer linear programming and finite domain...
We present a unifying framework for integer linear programming and finite domain constraint programm...
International audienceThe computer will be the most marvellous of all tools as soon as program writi...
International audienceCombinatorial problems involving sets and relations are currently tackled by i...
This paper introduces an instantiation of the constraint logic programming scheme called CLP(PolyFD)...
This paper summarizes a constraint solving technique that is used to reason effectively in the scope...
Existing libraries and languages for finite domain constraint programming have backtracking-based de...
We introduce branch-and-infer, a unifying framework for integer linear programming and finite domain...
Pseudo-Boolean constraints are a special form of finite domain constraints where all variables are d...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
This paper summarizes a constraint solving technique that can be used to reason effectively in the s...
Tutorial at CP'2002, Principles and Practice of Constraint Programming. Powerpoint slides.</p