Abstract
The abstract categorial grammars (ACGs, for short) are a type-theoretic grammatical formalism intended for the description of natural languages [1]. It is based on the implicative fragment of multiplicative linear logic, which results in a rather simple framework.
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
de Groote, Ph.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148–155 (2001)
de Groote, Ph.: Tree-Adjoining Grammars as Abstract Categorial Grammars. In: TAG+6, Proceedings of the sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, pp. 145–150 (2001)
de Groote, Ph., Guillaume, B., Salvati, S.: Vector Addition Tree Automata. In: LICS 2004. 19th IEEE Symposium on Logic in Computer Science, pp. 64–73. IEEE Computer Society, Los Alamitos (2004)
de Groote, Ph., Pogodalla, S.: On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. Journal of Logic, Language and Information 13(4), 421–438 (2004)
de Groote, P., Maarek, S.: Type-theoretic Extensions of Abstract Categorial Grammars. In: Proceedings of the Workshop on New Directions in Type-theoretic Grammars. ESSLLI (2007)
Harper, R., Honsel, F., Plotkin, G.: A framework for defining logics. In: Proceedings of the second annual IEEE symposium on logic in computer science, pp. 194–204. IEEE Computer Society Press, Los Alamitos (1987)
Kanazawa, M.: Parsing and Generation as Datalog Queries. In: Association for Computational Linguistics, 45th Annual Meeting, Proceedings of the Conference (to appear, 2007)
Lambek, J.: How to program an infinite abacus. Canadian Mathematical Bulletin 4, 279–293 (1961)
Lincoln, P., Mitchell, J.C., Scedrov, A., Shankar, N.: Decision Problems for Propositional Linear Logic. Annals of Pure and Applied Logic 56(1-3), 239–311 (1992)
Ranta, A.: Grammatical Framework: A Type-Theoretical Grammar Formalism. Journal of Functional Programming 14(2), 145–189 (2004)
Salvati, S.: Problèmes de filtrage et problèmes d’analyse pour les grammaires catégorielles abstraites. Thèse de Doctorat. Institut National Polytechnique de Lorraine (2005)
Yoshinaka, R., Kanazawa, M.: The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 330–346. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Groote, P., Maarek, S., Yoshinaka, R. (2007). On Two Extensions of Abstract Categorial Grammars. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-75560-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75558-6
Online ISBN: 978-3-540-75560-9
eBook Packages: Computer ScienceComputer Science (R0)