Abstract The Oz Programming Model (OPM) is a concurrent programming model subsuming
higher-order functional and object-oriented programming as facets of a general model. This …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

The timetabling problem consists in scheduling a sequence of lectures between teachers
and students in a prefixed period of time (typically a week), satisfying a set of constraints of …

Declarative programming languages advocate a programming style expressing the
properties of problems and their solutions rather than how to compute individual solutions …

By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model
of concurrency that is consistent with mobility and distribution. Our model provides the …

We describe the design and implementation of a finite domain constraint solver embedded
in a Prolog system using an extended unification mechanism via attributed variables as a …

Computers arechanging the way wethink. Of course, nearly all desk-workers have access to
computers and use them to email their colleagues, search the Web for information and …

Functional and logic programming are the most important declarative programming
paradigms, and interest in combining them has grown over the last decade. Early research …

The use of constraints had its scientific and commercial breakthrough in the 1990s.
Programming with constraints makes it possible to model and specify problems with …

Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …