ABSTRACT
The chapter presents three different types of constraint satisfaction problems, dealing with algebraic, logical and geometric constraints. The propagation of constraints through constraint nets to solve a given algebraic problem is illustrated with examples. An algorithm for testing constraint satisfiability is introduced. The principles of constraint logic programs have been outlined with examples. The junction labeling problem of trihedral objects has also been covered in sufficient details. Examples have been taken from electrical circuits, crypto-arithmetic and map coloring problems.
