Existential Arc Consistency: Getting Closer to Full Arc Consistency in Weighted CSPs
Abstract
The weighted CSP framework is a soft constraint framework with a wide range of applications. Most current state-of-the-art complete solvers can be described as a basic depth-first branch and bound search that maintain some form of arc consistency during the search. In this paper we introduce a new stronger form of arc consistency, that we call existential directional arc consistency and we provide an algorithm to enforce it. The efficiency of the algorithm is empirically demonstrated in a variety of domains.
Cite
Text
de Givry et al. "Existential Arc Consistency: Getting Closer to Full Arc Consistency in Weighted CSPs." International Joint Conference on Artificial Intelligence, 2005.Markdown
[de Givry et al. "Existential Arc Consistency: Getting Closer to Full Arc Consistency in Weighted CSPs." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/degivry2005ijcai-existential/)BibTeX
@inproceedings{degivry2005ijcai-existential,
title = {{Existential Arc Consistency: Getting Closer to Full Arc Consistency in Weighted CSPs}},
author = {de Givry, Simon and Heras, Federico and Zytnicki, Matthias and Larrosa, Javier},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {84-89},
url = {https://mlanthology.org/ijcai/2005/degivry2005ijcai-existential/}
}