Standard Article

History of Constraint Programming

  1. Roman Barták

Published Online: 14 JAN 2011

DOI: 10.1002/9780470400531.eorms0382

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Barták, R. 2011. History of Constraint Programming. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. Charles University, Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Prague, Czech Republic

Publication History

  1. Published Online: 14 JAN 2011

Abstract

Constraint programming is a technology for solving combinatorial optimization problems. It appeared in the 1960s in systems such as Sketchpad, and core ideas such as arc and path consistency techniques were proposed and developed in the 1970s. The real landmark of constraint programming was in the 1980s when researchers realized that unification in logic programming is a special form of constraint solving, and constraint logic programming appeared. Since that time, many solving techniques and approaches were studied, but the core idea of constraint programming remains the same—it is a technology based on integration of search techniques with special inference techniques exploiting the structure of constraints in the problem. Constraint programming is successful in many application areas. Scheduling is probably the most prominent one, but constraints are also applied when solving problems in planning, configuration, vehicle routing, networking, bioinformatics, and so on. This article describes how constraint programming evolved since its beginnings to the current state.

Keywords:

  • constraint programming;
  • history;
  • constraint modeling;
  • consistency techniques;
  • constraint propagation;
  • search