Computer Science – Artificial Intelligence
Scientific paper
2011-06-03
Journal Of Artificial Intelligence Research, Volume 14, pages 205-230, 2001
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.834
Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.
Bessiere Christian
Debruyne R.
No associations
LandOfFree
Domain Filtering Consistencies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Domain Filtering Consistencies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain Filtering Consistencies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224042