We discuss the relationship between constraint programming and database query languages. We show that bottom-up, efficient, declarative database programming can be combined with efficient constraintâ€¦ (More)

We demonstrate the power of object identities (oids) as a database query language primitive. We develop an object-based data model, whose structural part generalizes most of the known complex-objectâ€¦ (More)

We examine the computational complexity of testing finite state processes for equivalence, in the Calculus of Communicating Systems (CCS). This equivalence problem in CCS is presented as a refinementâ€¦ (More)

Constraints are a natural mechanism for the speci cation of similarity queries on time-series data. However, to realize the expressive power of constraint programming in this context, one mustâ€¦ (More)

The efficient parallel algorithms proposed for many fundamental problems, such as list ranking, integer sorting and computing preorder numberings on trees, are very sensitive to processor failures.â€¦ (More)

<italic>Datalog</italic> is the language of logic programs without function symbols. It is used as a database query language. If it is possible to eliminate recursion from a Datalog program &Pgr;,â€¦ (More)

The problem of unification of terms is log-spacc complete for P. In deriving this lower bound no use is made of the potentially concise representation of terms by directed acyclic graphs. Inâ€¦ (More)

Unary inclusion dependencies are database constraints expressing subset relationships. The decidability of implication for these dependencies together with embedded implicational dependencies, suchâ€¦ (More)

We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relationalâ€¦ (More)