A Best First approach for solving over-constrained dynamic problems
暂无分享,去创建一个
Many real-life problems tackled using Constraint Programming are dynamic. Addition and deletion of constraints may lead to inconsistencies. When a solution is required, constraints may be violated in order to ful ll the user requirements. In this paper, we propose a bestrst search method (parameterized by the domain of constraints and the associated solver) for solving over-constrained problems arising in dynamic environments. We propose a specialization of this approach for csp using arc-consistency. We address complexity issues to show the tractability of our approach and describe our implementation: the decorum system.
[1] Thomas Schiex,et al. Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" , 1992, UAI.
[2] Leon Sterling. A Reactive Constraint Logic Programming Scheme , 1995 .
[3] Michel Minoux,et al. Graphes et algorithmes , 1995 .
[4] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[5] Thomas Schiex,et al. Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems , 1993 .