Peek arc consistency

Authors:
Manuel Bodirsky;Hubie Chen
Affiliations:
LIX, Ecole Polytechnique, Greater Paris, France;Departament de Tecnologies de la Informació i les Comunicacions, Universitat Pompeu Fabra, Barcelona, Spain
Venue:
Theoretical Computer Science
Year:
2010

Citing 13
Cited 0

Constraint propagation algorithms for temporal reasoning: a revised report

Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations

Computational Intelligence
A shorter model theory

A shorter model theory
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability

SIAM Journal on Discrete Mathematics
Closure Functions and Width 1 Problems

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
On Digraph Coloring Problems and Treewidth Duality

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A rendezvous of logic, complexity, and algebra

ACM SIGACT News
Theoretical analysis of singleton arc consistency and its extensions

Artificial Intelligence
MAX ONES Generalized to Larger Domains

SIAM Journal on Computing
A complete classification of tractability in RCC-5

Journal of Artificial Intelligence Research
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Qualitative temporal and spatial reasoning revisited

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.