Proceedings

Existential arc consistency: Getting closer to full arc consistency in weighted CSPs

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 84-88.

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.

Simon de Givry, Federico Heras, Matthias Zytnicki, and Javier Larrosa. 2005. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 84–88. https://ijcai.org/proceedings/2005/90
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards