Space-Time tradeoffs for the regular constraint

Authors:
Kenil C. K. Cheng;Wei Xia;Roland H. C. Yap
Affiliations:
School of Computing, National University of Singapore, Singapore;School of Computing, National University of Singapore, Singapore;School of Computing, National University of Singapore, Singapore
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 10
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Griebach normal form transformation revisited

Information and Computation
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Reformulating Global Grammar Constraints

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Maintaining Generalized Arc Consistency on Ad-hoc n-ary Boolean Constraints

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
On reading sketch maps

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

Constraints
STR2: optimized simple tabular reduction for table constraints

Constraints
The theory of grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Global grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many global constraints can be described by a regular expression or a DFA. Originally, the regular constraint, uses a DFA to describe the constraint, however, it can also be used to express a table constraint. Thus, there are many representations for an equivalent constraint. In this paper, we investigate the effect of different representations on natural extensions of the regular constraint focusing on the space-time tradeoffs. We propose a variant of the regular constraint, nfac(X), where X can be an NFA, DFA or MDD. Our nfac algorithm enforces GAC directly on any of the input representations, thus, generalizing the mddc algorithm. We also give an algorithm to directly convert an NFA representation to an MDD for nfac(MDD) or mddc. Our experiments show that the NFA representation not only saves space but also time. When the ratio of the NFA over the MDD or DFA size is small enough, nfac(NFA) is faster. When the size ratio is larger, nfac(NFA) still saves space and is a bit slower. In some problems, the initialization cost of MDD or DFA can also be a significant overhead, unlike NFA which has low initialization cost. We also show that the effect of the early-cutoff optimization is significant in all the representations.