Abstract
We investigate the global Grammar constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the Grammar constraint in these cases is as hard as parsing an unrestricted context free grammar.We also consider the class of linear grammars and give a propagator that runs in quadratic time. Finally, to demonstrate the use of linear grammars, we show that a weighted linear Grammar constraint can efficiently encode the EditDistance constraint, and a conjunction of the EditDistance constraint and the Regular constraint.
NICTA is funded by the Australian Government’s Department of Broadband, Communications, and the Digital Economy and the Australian Research Council.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, N., Koch, R.: Greibach normal form transformation revisited. Inf. Comput. 150, 112–118 (1999)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9, 251–280 (1990)
Hopcroft, J.W., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)
Kadioglu, S., Sellmann, M.: Efficient context-free grammar constraints. In: AAAI, pp. 310–316 (2008)
Katsirelos, G., Narodytska, N., Walsh, T.: The weighted CFG constraint. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 323–327. Springer, Heidelberg (2008)
Katsirelos, G., Narodytska, N., Walsh, T.: Reformulating global grammar constraints. In: van Hoeve, W.J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 132–147. Springer, Heidelberg (2009)
Lagerkvist, M.: Techniques for Efficient Constraint Propagation. PhD thesis, KTH, Sweden (2008)
Lee, L.: Fast context-free grammar parsing requires fast boolean matrix multiplication. J. ACM 49, 1–15 (2002)
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)
Quimper, C., Walsh, T.: Decompositions of grammar constraints. In: AAAI, pp. 1567–1570 (2008)
Quimper, C.G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 751–755. Springer, Heidelberg (2006)
Quimper, C.G., Walsh, T.: Decomposing global grammar constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 590–604. Springer, Heidelberg (2007)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Heidelberg (2004)
Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 530–544. Springer, Heidelberg (2006)
Wagner, K., Wechsung, G.: Computational Complexity. Springer, Heidelberg (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katsirelos, G., Maneth, S., Narodytska, N., Walsh, T. (2009). Restricted Global Grammar Constraints. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)