Inverse Consistencies for Non-binary Constraints

Authors:
Kostas Stergiou;Toby Walsh
Affiliations:
Department of Information & Communication Systems Engineering University of the Aegean, Greece;National ICT Australia & University of New South Wales, Australia
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 9
Cited 4

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
On the minimality and global consistency of row-convex constraint networks

Journal of the ACM (JACM)
A generic customizable framework for inverse local consistency

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
On forward checking for non-binary constraint satisfaction

Artificial Intelligence
Binary vs. non-binary constraints

Artificial Intelligence
An optimal coarse-grained arc consistency algorithm

Artificial Intelligence
Domain filtering consistencies

Journal of Artificial Intelligence Research
Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results

Journal of Artificial Intelligence Research
Neighborhood inverse consistency preprocessing

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Conservative dual consistency

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Integrating strong local consistencies into constraint solvers

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Second-order consistencies

Journal of Artificial Intelligence Research
A framework for decision-based consistencies

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a detailed study of two inverse consistencies for non-binary constraints: relational path inverse consistency (rel PIC) and pairwise inverse consistency (PWIC). These are stronger than generalized arc consistency (GAC), even though they also only prune domain values. We propose algorithms to achieve rel PIC and PWIC, that have a time complexity better than the previous generic algorithm for inverse consistencies. One of our algorithms for PWIC has a complexity comparable to that for GAC despite doing more pruning. Our experiments demonstrate that inverse consistencies can be more efficient than GAC on a range of non-binary problems.