Top

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.

• Table of Contents

• 1 Introduction

• 2 Propagate and Distribute

• 3 Writing Problem Solvers in Oz

• 4 Elimination of Symmetries and Defined Constraints

• 5 Parameterized Scripts

• 6 Minimizing a Cost Function

• 7 Propagators for Redundant Constraints

• 8 Reified Constraints

• 9 User-Defined Distributors

• 10 Branch and Bound

• 11 Scheduling

• A Traps and Pitfalls

• B Golden Rules

• C Example Data

• Answers to the Exercises

• Bibliography

• Index