P. Bédaride and C. Gardent, Semantic normalisation, Proceedings of the Eighth International Conference on Computational Semantics, IWCS-8 '09, 2009.
DOI : 10.3115/1693756.1693805

B. Bohnet and L. Wanner, On using a parallel graph rewriting formalism in generation, Proceedings of the 8th European workshop on Natural Language Generation , EWNLG '01, pp.1-11, 2001.
DOI : 10.3115/1117840.1117847

G. Bonfante, B. Guillaume, M. Morey, and G. Perrier, Modular graph rewriting to compute semantics, IWCS 2011, pp.65-74, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00579244

F. Chaumartin and S. Kahane, Une approche paresseuse de l'analyse sémantique ou comment construire une interface syntaxe-sémantiquè a partir d'exemples, 2010.

A. Copestake, Invited Talk: Slacker Semantics: Why Superficiality, Dependency and Avoidance of Commitment can be the Right Way to Go, Proceedings of the 12th Conference of the European Chapter, pp.1-9, 2009.

D. P. Crouch, Packed Rewriting for Mapping Semantics to KR Towards Abstract Categorial Grammars, Proceedings of IWCS. de Groote, 39th Annual Meeting of the Association for Computational Linguistics and 10th Conference of the European Chapter, pp.148-155, 2001.

R. Echahed, Inductively Sequential Term-Graph Rewrite Systems, Proceedings of the 4th international conference on Graph Transformations, ICGT '08, pp.84-98, 2008.
DOI : 10.1007/978-3-540-87405-8_7

E. Godard, Y. Métivier, M. Mosbah, and A. Sellami, Termination Detection of Distributed Algorithms by Graph Relabelling Systems, ICGT, volume 2505 of Lecture Notes in Computer Science, pp.106-119, 2002.
DOI : 10.1007/3-540-45832-8_10

B. Guillaume and G. Perrier, Annotation sémantique du French TreebankàTreebank`Treebankà l'aide de la réécriture modulaire de graphes, Traitement Automatique des Langues Naturelles (TALN), 2012.

M. Hofmann, Linear types and non-size-increasing polynomial time computation, Information and Computation, pp.464-473, 1998.
DOI : 10.1109/lics.1999.782641
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.216

E. Hyvönen, Semantic Parsing as Graph Language Transformation -a Multidimensional Approach to Parsing Highly Inflectional Languages, In COLING, pp.517-520, 1984.

D. Janssens and G. Rozenberg, Graph grammars with neighbourhood-controlled embedding, Theoretical Computer Science, vol.21, issue.1, pp.55-74, 1982.
DOI : 10.1016/0304-3975(82)90088-3

V. Jijkoun and M. De-rijke, Learning to transform linguistic graphs, Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing, 2007.

N. D. Jones, Computability and Complexity from a Programming Perspective, 1997.
DOI : 10.1007/978-94-010-0413-8_4

R. M. Kaplan and J. Bresnan, Lexical-functional grammar: A formal system for grammatical representation, editor, The Mental Representation of Grammatical Relations, pp.173-281, 1982.

D. Knuth and P. Bendix, Simple Word Problems in Universal Algebras, Computational problems in abstract algebra, 1970.
DOI : 10.1007/978-3-642-81955-1_23

R. Montague, Universal grammar, Theoria, vol.26, issue.3, pp.373-398, 1970.
DOI : 10.1111/j.1755-2567.1970.tb00434.x

R. Montague, The proper treatment of quantification in ordinary english. Formal Semantics, pp.221-242, 1973.

M. Newman, On Theories with a Combinatorial Definition of "Equivalence", The Annals of Mathematics, vol.43, issue.2, pp.223-243, 1942.
DOI : 10.2307/1968867

D. Plump, On termination of graph rewriting, Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG '95, pp.88-100, 1995.
DOI : 10.1007/3-540-60618-1_68

D. Plump, Termination of graph rewriting is undecidable, Fundamenta Informaticae, vol.33, issue.2, pp.201-209, 1998.

C. Pollard and I. A. Sag, Head-Driven Phrase Structure Grammar, 1994.

E. Roche and Y. Schabes, Finite-State Language Processing, 1997.

G. Rozenberg, Handbook of Graph Grammars and Computing by Graph Transformations, Foundations. World Scientific, vol.1, 1997.
DOI : 10.1142/3303