|Author(s)|| Mark G. Wallace|
|Text||Wallace, M.G.: Constraint Programming. In: Liebowitz, J. (ed.), The Handbook
of Applied Expert Systems, CRC Press, 1998.|
|Type||Technical Report, Misc|
Constraint programming is a paradigm that is tailored to hard search
problems. To date the main application areas are those of planning, scheduling, timetabling, routing, placement, investment, configuration, design and insurance. Constraint programming incorporates techniques from mathematics, artificial intelligence and operations research, and it offers significant advantages in these areas since it supports fast program development, economic program maintenance, and efficient runtime performance. The direct representation of the problem, in terms of constraints, results in short, simple programs that can be easily adapted to changing requirements. The integration of these techniques into a coherent high-level language enables the programmer to concentrate on
choosing the best combination for the problem at hand. Because programs are quick to develop and to modify, it is possible to experiment with
ways of solving a problem until the best and fastest program has been found. Moreover more complex problems can be tackled without the programming task becoming unmanageable. A tutorial introduction to constraint logic programming can be found in (Frühwirth et al, 1992).