Constraints are a natural means of knowledge representation in many disparate fields. A constraint often takes the form of an equation or inequality, but in the most abstract sense is simply a logical relation among several variables expressing a set of admissible value combinations. The following are simple examples: the sum of two variables must equal 30; no two adjacent countries on the map may be coloured the same; the helicopter is designed to carry only one passenger, although a second can be carried in an emergency; the maths class must be scheduled between 9 and 11am, but it may be moved to the afternoon later in the term. It is this generality and simplicity of structure which underly the ubiquity of the constraint-based representation in Artificial Intelligence.


Constraint Satisfaction Constraint Satisfaction Problem Search Effort Hierarchical Decomposition Flexible Planning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Ian Miguel
    • 1
  1. 1.University of YorkUSA

Personalised recommendations