The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
In this paper we consider the consistency problem of temporal or spatial qualitive constraint networks. A new encoding making it possible to represent and solve this problem in th...
XML Schema supports the specification of occurrence constraints by declaring values for its min/maxOccurs attributes. These constraints are structural in the sense that they rest...