Relational consistency by constraint filtering

Authors:
Shant Karakashian;Robert J. Woodward;Berthe Y. Choueiry;Christian Bessiere
Affiliations:
University of Nebraska-Lincoln;University of Nebraska-Lincoln;University of Nebraska-Lincoln;LIRMM-CNRS University Montpellier, France
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 7
Cited 0

On the complexity of join dependencies

ACM Transactions on Database Systems (TODS)
Local and global relational consistency

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Constraint Processing

Constraint Processing
Domain filtering consistencies for non-binary constraints

Artificial Intelligence
A fast arc consistency algorithm for n-ary constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results

Journal of Artificial Intelligence Research
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm operates by filtering the constraint while leaving the topology of the graph unchanged. We study the resulting relational consistency property and compare it to existing ones. We evaluate the effectiveness of our algorithm in a search procedure for solving CSPs and demonstrate the applicability, effectiveness, and usefulness of enforcing high levels of consistency.