Computation	CONCURRENT CONSTRAINT PROGRAMMING IN OZ
Introductory course	GERT SMOLKA Programming Systems Lab, DFKI and University of the Saarland
Second week	smolka@dfki.de
Course description	The concurrent constraint paradigm is a promising approach to the construction of efficient inference engines. Constraints are implemented as concurrent agents that communicate through partial information. This way one can combine different inference techniques in a modular fashion. Oz is a rich programming language combining the concurrent constraint approach with state of the art programming constructs such as first-class procedures, objects, exceptions, and threads. Oz pioneers first-class spaces, a programming construct that encapsulates speculative computations and don't know nondeterminism. The course will introduce the basic ideas behind concurrent constraints and Oz. It will mainly address practical issues. We will see how combinatorial problems can be solved with finite domain constraints. We will also consider the implementation of constraint grammars with feature constraints.
Prerequisites	None
Literature	No specific recommendation