Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …

Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms:
constraint solving and logic programming. Although a relatively new field, CLP has …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

Concurrent constraint programming[Sar89, SR90] is a simple and powerful model of
concurrent computation based on the notions of store-as-constraint and process as …

We study a timed concurrent constraint language, called tccp, which is obtained by a natural
timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next …

Soft constraints extend classical constraints to represent multiple consistency levels, and
thus provide a way to express preferences, fuzziness, and uncertainty. While there are many …

This paper addresses the problem of defining a formal tool to compare the expressive power
of different concurrent constraint languages. We refine the notion of embedding by adding …

Drawing from an analogy between features based Product Line (PL) models and Constraint
Programming (CP), this paper explores the use of CP in the Domain Engineering and …

We investigate the semantics of concurrent constraint programming and of various
sublanguages, with particular emphasis on nondeterminism and infinite behavior. The aim is …

Linear typing schemes guarantee single-threadedness and so the soundness of in-place
update with respect to a functional semantics. But linear schemes are restrictive in practice …