Peek Arc Consistency - Computer Science > Artificial IntelligenceReport as inadecuate

Peek Arc Consistency - Computer Science > Artificial Intelligence - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper studies peek arc consistency, a reasoning technique that extendsthe well-known arc consistency technique for constraint satisfaction. Incontrast to other more costly extensions of arc consistency that have beenstudied in the literature, peek arc consistency requires only linear space andquadratic time and can be parallelized in a straightforward way such that itruns in linear time with a linear number of processors. We demonstrate that forvarious constraint languages, peek arc consistency gives a polynomial-timedecision procedure for the constraint satisfaction problem. We also present analgebraic characterization of those constraint languages that can be solved bypeek arc consistency, and study the robustness of the algorithm.

Author: Manuel Bodirsky, Hubie Chen


Related documents