Sciweavers

27 search results - page 1 / 6
» Solving weighted CSP by maintaining arc consistency
Sort
View
AI
2004
Springer
13 years 4 months ago
Solving weighted CSP by maintaining arc consistency
Javier Larrosa, Thomas Schiex
IJCAI
2003
13 years 6 months ago
In the quest of the best form of local consistency for Weighted CSP
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...
Javier Larrosa, Thomas Schiex
FLAIRS
2007
13 years 7 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
IJCAI
2007
13 years 6 months ago
The Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CP
2000
Springer
13 years 9 months ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...