TítolOpen, interactive and dynamic CSP
Publication TypeConference Paper
Year of Publication2005
AuthorsMacho-González S, Meseguer P
EditorBrown GVerfaillie
Conference NameChanges'05 International Workshop on Constraint Solving under Change and Uncertainty
Paginació13 - 17
Resum

In previous work, the notions of Open, Interactive and Dynamic CSP have been independently de_ned. Open constraint satisfaction is a new model where values are incrementally gathered during problem solving. Domains are assumed unbounded. Interactive constraint satisfaction also deals with partially known domains, assuming implicitly that domains are _nite. Dynamic constraint satisfaction deals with problems of dynamic nature (as con_guration design or model composition) where variables, domains and constraints are subject to frequent changes. In this paper, we study the relationship between these three models, showing that Interactive CSP can be seen as a particular case of Open and Dynamic. We have applied two algorithms, FOCSP (developed for Open) and LC (developed for Dynamic) to solve Interactive CSP. We provide experimental results of this evaluation