Dynamic Backtracking for Dynamic Constraint Satisfaction Problems (1994)
| Venue: | In Proceedings of the ECAI-94 Workshop on Constraint Satisfaction Issues Raised by Practical Applications |
| Citations: | 10 - 1 self |
BibTeX
@INPROCEEDINGS{Verfaillie94dynamicbacktracking,
author = {Gérard Verfaillie and Thomas Schiex},
title = {Dynamic Backtracking for Dynamic Constraint Satisfaction Problems},
booktitle = {In Proceedings of the ECAI-94 Workshop on Constraint Satisfaction Issues Raised by Practical Applications},
year = {1994},
pages = {1--8}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 Backtracking algorithm proposed in (Ginsberg 1993) does not solve dynamic CSPs, but static ones. But its nogood recording and backtracking mechanisms are very interesting in the DCSP framework. In this paper, we propose an extension of this algorithm which provides the user with explanations in case of inconsistency and allows dynamic CSPs to be dealt with very efficiently. After presenting the Dynamic Backtracking algorithm, its extension and how to use it in the DCSP framework, we present and discuss some experimental results. Dynamic backtracking In (Ginsberg 1993), Matthew L. Ginsberg proposed a new algorithm for solv...
