Reformulating Global Grammar Constraints

An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the Regular and Grammar constraints specify constraints in terms of the languages accepted by an automaton and a context-free grammar respectively. Taking advantage of the fixed length of the constraint, we give an algorithm to transform a context-free grammar into an automaton. We then study the use of minimization techniques to reduce the size of such automata and speed up propagation. We show that minimizing such automata after they have been unfolded and domains initially reduced can give automata that are more compact than minimizing before unfolding and reducing. Experimental results show that such transformations can improve the size of rostering problems that we can "model and run".

[1]  Toby Walsh,et al.  A Compression Algorithm for Large Arity Extensional Constraints , 2007, CP.

[2]  Gilles Pesant,et al.  Constraint Programming Based Column Generation for Employee Timetabling , 2005, CPAIOR.

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5]  Jérôme Amilhastre,et al.  FA Minimisation Heuristics for a Class of Finite Languages , 1999, WIA.

[6]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[7]  Dominique Revuz,et al.  Minimisation of Acyclic Deterministic Automata in Linear Time , 1992, Theor. Comput. Sci..

[8]  Toby Walsh,et al.  Global Grammar Constraints , 2006, CP.

[9]  Fahiem Bacchus,et al.  GAC Via Unit Propagation , 2007, CP.

[10]  Adnan Darwiche,et al.  On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision , 2001, J. Appl. Non Class. Logics.

[11]  Mikael Z. Lagerkvist.  Techniques for Efficient Constraint Propagation , 2008 .

[12]  Meinolf Sellmann.  The Theory of Grammar Constraints , 2006, CP.

[13]  Toby Walsh,et al.  Decomposing Global Grammar Constraints , 2007, CP.

[14]  Serdar Kadioglu,et al.  Efficient Context-Free Grammar Constraints , 2008, AAAI.

[15]  Louis-Martin Rousseau,et al.  Formal languages for integer programming modeling of shift scheduling problems , 2009, Constraints.

[16]  Mats Carlsson,et al.  Deriving Filtering Algorithms from Constraint Checkers , 2004, CP.