Dynamic Backtracking for Dynamic Constraint Satisfaction Problems

  title={Dynamic Backtracking for Dynamic Constraint Satisfaction Problems},
  author={erard Verfaillie},
  • erard Verfaillie
  • Published 1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or the other agents in the framework of a distributed system. The notion of dynamic CSP (DCSP) has been introduced to represent them. In spite of its name, the recent Dynamic Back-tracking algorithm proposed in (Ginsberg 1993) does not solve dynamic CSPs, but static ones. But its nogood recording and… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 15 references

Probl  emes de Satisfaction deContraintes : Production et R  evision de Solution parModi cations Locales

  • G. Verfaillie
  • 1993
Highly Influential
4 Excerpts

Maintenance of Solution in a Dynamic Constraint Satisfaction Problem

  • A. ReferencesBellicha
  • Proc . ofApplications of Arti cial Intelligence…
  • 1993

Similar Papers

Loading similar papers…