Solution techniques for constraint satisfaction problems: Foundations

I. Miguel*, Q. Shen

*Corresponding author for this work

Research output: Contribution to journalReview articlepeer-review

16 Citations (Scopus)


The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide applicability, ranging from machine vision and temporal reasoning to planning and logic programming. This paper attempts a systematic and coherent review of the foundations of the techniques for constraint satisfaction. It discusses in detail the fundamental principles and approaches. This includes an initial definition of the constraint satisfaction problem, a graphical means of problem representation, conventional tree search solution techniques, and pre-processing algorithms which are designed to make subsequent tree search significantly easier.

Original languageEnglish
Pages (from-to)243-267
Number of pages25
JournalArtificial Intelligence Review
Issue number4
Publication statusPublished - Jun 2000


  • Consistency enforcing
  • Constraint graph
  • Constraint Satisfaction Problems
  • Pre-processing
  • Tree search


Dive into the research topics of 'Solution techniques for constraint satisfaction problems: Foundations'. Together they form a unique fingerprint.

Cite this