Peek Arc Consistency

Details Peek Arc Consistency Peek Arc Consistency

2008-09-04

arxiv.org/abs/0809.0788v2

Computer Science

Artificial Intelligence

Scientific paper

This paper studies peek arc consistency, a reasoning technique that extends the well-known arc consistency technique for constraint satisfaction. In contrast to other more costly extensions of arc consistency that have been studied in the literature, peek arc consistency requires only linear space and quadratic time and can be parallelized in a straightforward way such that it runs in linear time with a linear number of processors. We demonstrate that for various constraint languages, peek arc consistency gives a polynomial-time decision procedure for the constraint satisfaction problem. We also present an algebraic characterization of those constraint languages that can be solved by peek arc consistency, and study the robustness of the algorithm.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141785