Abstract
With the introduction of the Regular Membership Constraint, a new line of research has opened where constraints are based on formal languages. This paper is taking the next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise a time- and space-efficient incremental 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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Beldiceanu, N., Carlsson, M., & Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In Principles and practice of constraint programming (CP). LNCS (Vol. 3258, pp. 107–122).
Bessiere, C., & Cordier, M. O. (1993). Arc-consistency and arc-consistency again. In AAAI.
Bessière, C., & Régin, J.-C. (1998). Local consistency on conjunctions of constraints. In Workshop on non-binary constraints.
Bourdais, S., Galinier, P., & Pesant, G. (2003). HIBISCUS: A constraint programming application to staff scheduling in health care. In Principles and practice of constraint programming (CP). LNCS (Vol. 2833, pp. 153–167).
Chomsky, N. (1956). Three models for the description of language. IRE Transactions on Information Theory, 2, 113–124.
Demassey, S., Pesant, G., & Rousseau, L.-M. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315–333.
Fahle, T., Junker, U., Karisch, S. E., Kohl, N., Sellmann, M., & Vaaben, B. (2002). Constraint programming based column generation for crew assignment. Journal of Heuristics, 8(1), 59–81.
Focacci, F., Lodi, A., & Milano, M. (1999). Cost-based domain filtering. In Principles and practice of constraint programming (CP). LNCS (Vol. 1713, pp. 189–203).
Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages and computation. Reading: Addison Wesley.
Kadioglu, S., & Sellmann, M. (2008). Efficient context-free grammar constraints. In AAAI (pp. 310–316).
Katriel, I., Sellmann, M., Upfal, E., & Van Hentenryck, P. (2007). Propagating knapsack constraints in sublinear time. In AAAI (pp. 231–236).
Lhomme, O. (2004). Arc-consistency filtering algorithms for logical combinations of constraints. In Integration of AI and OR techniques in constraint programming (CPAIOR). LNCS (Vol. 3011, pp. 209–224).
Pesant, G. (2003). A regular language membership constraint for sequences of variables In Workshop on modelling and reformulating constraint satisfaction problems (pp. 110–119).
Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Principles and practice of constraint programming (CP). LNCS (Vol. 3258, pp. 482–495).
Pesant, G., Quimper, C.-G., Rousseau, L.-M., & Sellmann, M. (2009). The polytope of context-free grammar constraints. In Integration of AI and OR techniques in constraint programming (CPAIOR). LNCS (Vol. 5547, pp. 223–232).
Quimper, C.-G., & Rousseau, L.-M. (2007). Language based operators for solving shift scheduling problems. In Metaheuristics conference.
Quimper, C.-G., & Walsh, T. (2006). Global grammar constraints. In Principles and practice of constraint programming (CP). LNCS (Vol. 3258, pp. 751–755).
Quimper, C.-G., & Walsh, T. (2007). Decomposing global grammar constraints. In Principles and practice of constraint programming (CP). LNCS (Vol. 4741, pp. 590–604).
Rousseau, L.-M., Pesant, G., & van Hoeve, W.-J. (2005). On global warming: Flow based soft global constraint. Informs, 27.
Sellmann, M. (2004). Theoretical foundations of CP-based lagrangian relaxation. In Principles and practice of constraint programming (CP). LNCS (Vol. 3258, pp. 634–647).
Sellmann, M. (2006). The theory of grammar constraints. In Principles and practice of constraint programming (CP). LNCS (Vol. 4204, pp. 530–544).
Trick, M. (2001). A dynamic programming approach for consistency and propagation for knapsack constraints. In Integration of AI and OR techniques in constraint programming (CPAIOR) (pp. 113–124).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kadioglu, S., Sellmann, M. Grammar constraints. Constraints 15, 117–144 (2010). https://doi.org/10.1007/s10601-009-9073-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-009-9073-4