Arc Consistency and Friends

Details Arc Consistency and Friends Arc Consistency and Friends

2011-04-26

arxiv.org/abs/1104.4993v1

Computer Science

Artificial Intelligence

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Arc Consistency and Friends 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 Arc Consistency and Friends, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arc Consistency and Friends will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-297088