Constraint programming (CP) is an emergent software technology for declarative description
and effective solving of large, particularly combinatorial, problems especially in areas of …

This paper presents a computational model for the cooperation of constraint domains and an
implementation for a particular case of practical importance. The computational model …

The main goal of this the thesis is to design efficient calculi that can serve as operational
semantics of a higher-order functional logic programming language and their distributed …

Combining a set of existing constraint solvers into an integrated system of cooperating
solvers is a useful and economic principle to solve hybrid constraint problems. In this paper …

We propose a general scheme for the cooperation of different constraint solvers. A uniform
interface for constraint solvers allows to formally specify information exchange between …

We propose a general framework for combining mobile processes and declarative
programming languages, eg, functional, logic or functional-logic languages. In contrast to …

Declarative programming languages base on the idea that programs should be as close as
possible to the problem specification and domain. Programs of these languages usually …

Meta-S is a practical implementation and extension of the theoretical framework developed
by Hofstedt, which allows the user to attack problems requiring the cooperation of arbitrary …

NOTE TO USERS Page 1 NOTE TO USERS This reproduction is the best copy available. ® UMI
Reproduced with permission of the copyright owner. Further reproduction prohibited without …

We propose a general scheme for the cooperation of different constraint solvers. On top of a
uniform interface for constraint we stepwise develop reduction systems which describe the …