On Dual Encodings for Non-binary Constraint Satisfaction Problems

Authors:
Sivakumar Nagarajan;Scott D. Goodwin;Abdul Sattar;John Thornton
Affiliations:
-;-;-;-
Venue:
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Year:
2000

Citing 3
Cited 0

Tree clustering for constraint networks (research note)

Artificial Intelligence
Encodings of non-binary constraint satisfaction problems

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
Non-Binary Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [Walsh and Stergiou, 1999] enforcing arc consistency (AC) in the dual encoding was shown to strictly dominate enforcing AC on the hidden or GAC on the original problem. We introduce a dual encoding that requires only a small subset of the original constraints to be stored in extension, while the remaining constraints can be stored intensionally. In this paper we present a theoretical comparison between the pruning achieved by enforcing AC on this dual encoding, versus enforcing GAC and dual arc consistency on the standard encoding. We show how the covering based encoding retains the dominance over enforcing GAC on the original problem, while using less space than the existing dual encoding.