Constraint Satisfaction Problems: An Overview

Article type: Research Article

Authors: Meseguer, Pedro

Affiliations: Centre d'Estudis Avancats de Blanes, C.S.I.C Cami de Santa Barbara, 17300 Blanes, Girona, Spain, E-mail: [email protected]

Abstract: Many AI problems can be formulated as Constraint Satisfaction Problems (CSP). Using a systematic search process with backtracking this kind of problems can be solved, but this method is very inefficient. Other methods solving CSP have been developed showing a better performance. In this paper an overview of methods (algorithms and heuristics) solving CSP is presented, stressing the key ideas underlying the different methods.

DOI: 10.3233/AIC-1989-2101

Journal: AI Communications, vol. 2, no. 1, pp. 3-17, 1989