## Principles of Constraint Programming (2000)

Citations: | 168 - 3 self |

### BibTeX

@MISC{Apt00principlesof,

author = {Krzysztof R. Apt},

title = {Principles of Constraint Programming},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

Introduction 1.1 Preliminaries Constraint programming is an alternative approach to programming in which the programming process is limited to a generation of requirements (constraints) and a solution of these requirements by means of general or domain specific methods. The general methods are usually concerned with techniques of reducing the search space and with specific search methods. In contrast, the domain specific methods are usually provided in the form of special purpose algorithms or specialised packages, usually called constraint solvers. Typical examples of constraint solvers are: ffl a program that solves systems of linear equations, ffl a package for linear programming, ffl an implementation of the unification algorithm, a cornerstone of automated theorem proving. Problems that can be solved in a natural way by means of constraint programming are usually those for which efficient algorithms are