Top
Print

Finite Domain Constraint Programming in Oz. A Tutorial.

Christian Schulte and Gert Smolka

This document is an introduction to constraint programming in Oz. We restrict our attention to combinatorial problems that can be stated with variables ranging over finite sets of nonnegative integers. Problems in this class range from puzzles to real world applications as diverse as scheduling, ware house allocation, configuration and placement.



Christian Schulte and Gert Smolka
Version 1.2.5 (20030129)