Arc Consistency and Friends
Artificial Intelligence
2011-04-27 v1 Computational Complexity
Logic in Computer Science
Abstract
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc consistency, a heavily investigated inference method, and three extensions thereof from the perspective of constraint languages. We conduct a comparison of the studied methods on the basis of which constraint languages they solve, and we present new polynomial-time tractability results for singleton arc consistency, the most powerful method studied.
Cite
@article{arxiv.1104.4993,
title = {Arc Consistency and Friends},
author = {Hubie Chen and Victor Dalmau and Berit Grußien},
journal= {arXiv preprint arXiv:1104.4993},
year = {2011}
}