Hard, flexible and dynamic constraint satisfaction

Ian Miguel*, Qiang Shen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet powerful representation. An increasing amount of attention has recently been paid to the development of constraint satisfaction techniques, and it has become clear that the original formulation of a static Constraint Satisfaction Problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Two important extensions to the classical CSP framework which address some of these deficiencies are flexible and dynamic constraint satisfaction. This paper examines in detail classical, flexible and dynamic CSP. It reviews the motivations behind both extensions, and describes the techniques used to solve each type of problem. The paper employs a running example throughout to illustrate the ideas presented.

Original languageEnglish
Pages (from-to)199-220
Number of pages22
JournalKnowledge Engineering Review
Volume14
Issue number3
DOIs
Publication statusPublished - Sept 1999

Fingerprint

Dive into the research topics of 'Hard, flexible and dynamic constraint satisfaction'. Together they form a unique fingerprint.

Cite this