B. Bohnet & L. Wanner (2001):
On using a parallel graph rewriting formalism in generation.
In: EWNLG '01: Proceedings of the 8th European workshop on Natural Language Generation.
Association for Computational Linguistics,
pp. 1–11,
doi:10.3115/1117840.1117847.
G. Bonfante & B. Guillaume (2013):
Non-size increasing Graph Rewriting for Natural Language Processing.
to appear in Mathematical Structures for Computer Science.
G. Bonfante, B. Guillaume, M. Morey & G. Perrier (2011):
Modular Graph Rewriting to Compute Semantics.
In: IWCS 2011,
Oxford, UK,
pp. 65–74.
A. Copestake (2009):
Invited Talk: Slacker Semantics: Why Superficiality, Dependency and Avoidance of Commitment can be the Right Way to Go.
In: Proceedings of the 12th Conference of the European Chapter of the ACL (EACL 2009).
Association for Computational Linguistics,
Athens, Greece,
pp. 1–9.
D. Crouch (2005):
Packed Rewriting for Mapping Semantics to KR.
In: Proceedings of IWCS.
R. Echahed (2008):
Inductively Sequential Term-Graph Rewrite Systems.
In: Proceedings of the 4th international conference on Graph Transformations,
ICGT '08.
Springer-Verlag,
Berlin, Heidelberg,
pp. 84–98,
doi:10.1007/978-3-540-87405-8_7.
E. Godard, Y. Métivier, M. Mosbah & A. Sellami (2002):
Termination Detection of Distributed Algorithms by Graph Relabelling Systems.
In: A. Corradini, H. Ehrig, H.-J. Kreowski & G. Rozenberg: ICGT,
Lecture Notes in Computer Science 2505.
Springer,
pp. 106–119,
doi:10.1007/3-540-45832-8_10.
E. Hyvönen (1984):
Semantic Parsing as Graph Language Transformation - a Multidimensional Approach to Parsing Highly Inflectional Languages.
In: COLING,
pp. 517–520,
doi:10.3115/980491.980601.
V. Jijkoun & M. de Rijke (2007):
Learning to Transform Linguistic Graphs.
In: Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing, Rochester, NY, USA.
D.E. Knuth & P.B. Bendix (1970):
Simple word problems in universal algebras.
In: J. Leech: Computational problems in abstract algebra,
Pergamon,
pp. 263–277.
M. Newman (1942):
On Theories With a Combinatorial Definition of "Equivalence".
Annals of Math. 43(2),
pp. 223–243,
doi:10.2307/1968867.
G. Perrier & B. Guillaume (2012):
Semantic Annotation of the French Treebank with Modular Graph Rewriting.
In: Jan Hajic: META-RESEARCH Workshop on Advanced Treebanking, LREC 2012 Workshop.
META-NET,
Istanbul, Turquie.
Available at http://hal.inria.fr/hal-00760577.
D. Plump (1995):
On Termination of Graph Rewriting.
In: Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science,
WG '95.
Springer-Verlag,
London, UK,
pp. 88–100,
doi:10.1007/3-540-60618-1_68.
D. Plump (1998):
Termination of Graph Rewriting is Undecidable.
Fundamenta Informaticae 33(2),
pp. 201–209,
doi:10.3233/FI-1998-33204.
G. Rozenberg (1997):
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations.
World Scientific.
L. Tesnière (1959):
Eléments de syntaxe structurale.
Librairie C. Klincksieck, Paris.
eptcs@eptcs.org