Abstract
By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated by this work, taking the obvious next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise an arc-consistency algorithm for context-free grammars, investigate when logic combinations of grammar constraints are tractable, show how to exploit non-constant size grammars and reorderings of languages, and study where the boundaries run between regular, context-free, and context-sensitive grammar filtering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bacchus, F., Walsh, T.: Propagating Logical Combinations of Constraints. In: International Joint Conference on Artificial Intelligence, pp. 35–40 (2005)
Beldiceanu, N., Carlsson, M., Petit, T.: Deriving Filtering Algorithms from Constraint Checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)
Bessière, C., Régin, J.-C.: Local consistency on conjunctions of constraints. In: Workshop on Non-Binary Constraints (1998)
Bourdais, S., Galinier, P., Pesant, G.: HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 153–167. Springer, Heidelberg (2003)
Chomsky, N.: Three models for the description of language. IRE Transactions on Information Theory 2, 113–124 (1956)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (1979)
Lhomme, O.: Arc-consistency Filtering Algorithms for Logical Combinations of Constraints. In: International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (2004)
Rousseau, L.-M., Pesant, G., van Hoeve, W.-J.: On Global Warming: Flow Based Soft Global Constraint. Informs, 27 (2005)
Pesant, G.: A Regular Language Membership Constraint for Finite Sequences of Variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)
Pesant, G.: A Regular Language Membership Constraint for Sequences of Variables. In: International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 110–119 (2003)
Trick, M.: A dynamic programming approach for consistency and propagation for knapsack constraints. In: International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 113–124 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sellmann, M. (2006). The Theory of Grammar Constraints. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_38
Download citation
DOI: https://doi.org/10.1007/11889205_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)