This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...