Bounded Backtracking for the Valued Constraint Satisfaction Problems

@inproceedings{Terrioux2003BoundedBF,
  title={Bounded Backtracking for the Valued Constraint Satisfaction Problems},
  author={Cyril Terrioux and Philippe J{\'e}gou},
  booktitle={CP},
  year={2003}
}
We propose a new method for solving Valued Constraint Satisfaction Problems based both on backtracking techniques branch and bound and the notion of tree-decomposition of valued constraint networks. This mixed method aims to benefit from the practical efficiency of enumerative algorithms while providing a warranty of a bounded time complexity. Indeed the time complexity of our method is O(d ++1) with w an approximation of the tree-width of the constraint network and d the maximum size of… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs

2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI) • 2017
View 2 Excerpts

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms • 2013
View 1 Excerpt

References

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

Topological Parameters for Time-Space Tradeoff

UAI • 1996
View 7 Excerpts
Highly Influenced

Tree Clustering for Constraint Networks

Artif. Intell. • 1989
View 6 Excerpts
Highly Influenced

Graph minors II

N. Robertson, P. D. Seymour
Algorithmic aspects of treewidth. Algorithms, • 1986
View 3 Excerpts
Highly Influenced

Larrosa . On arc and node consistency

M. Lemâıtre G. Verfaillie
2002

On arc and node consistency

J. Larrosa
In Proc. of AAAI, • 2002
View 2 Excerpts

Une comparaison des cohérences d’arc dans les Max-CSP

T. Schiex
In Actes des JNPC’2002, pages 209–223, • 2002
View 2 Excerpts

Similar Papers

Loading similar papers…