DMCA
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Constraints 15 (2 (2010)
| Citations: | 18 - 1 self |
BibTeX
@MISC{Cheng10anmdd-based,
author = {Kenil C. K. Cheng and H. C. Yap},
title = {An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Constraints 15 (2},
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. A table constraint is explicitly represented its set of solu-tions or non-solutions. This ad hoc (or extensional) representation may require space exponential to the arity of the constraint, making enforcing GAC expensive. In this paper, we address the space and time inefficien-cies simultaneously by presenting the mddc constraint. mddc is a global constraint that represents its (non-)solutions with a multi-valued deci-sion diagram (MDD). The MDD-based representation has the advantage that it can be exponentially smaller than a table. The associated GAC algorithm (called mddc) has time complexity linear to the size of the MDD, and achieves full incrementality in constant time. In addition, we show how to convert a positive or negative table constraint into an mddc constraint in time linear to the size of the table. Our experiments on structured problems, car sequencing and still-life, show that mddc is also a fast GAC algorithm for some global constraints such as sequence and regular. We also show that mddc is faster than the state-of-the-art generic GAC algorithms in [2–4] for table constraint. 1
Keyphrases
global constraint negative table constraint mdd-based generalized arc consistency algorithm table constraint mddc constraint constant time state-of-the-art generic gac algorithm full incrementality fast gac algorithm car sequencing space exponential mdd-based representation associated gac algorithm time inefficien-cies multi-valued deci-sion diagram structured problem ad hoc time complexity
