Inria / Raweb 2004
Project-Team: CALLIGRAMME

Search in Activity Report, year 2004:
HELP

INDEX

Bibliography

Major publications by the team in recent years

[1]
J. Besombes, J.-Y. Marion.
Apprentissage des langages réguliers d'arbres et applications, in: "Traitement automatique de langues", July 2003, vol. 44, no 1, p. 121–153.
[2]
D. Leivant, J.-Y. Marion.
A characterization of alternating log time by ramified recurrence, in: "Theoretical Computer Science", 2000, vol. 236, no 1-2, p. 192–208.
[3]
G. Perrier.
Interaction Grammars, in: "CoLing 2000, Sarrebrücken, Germany", International Committee on Computational Linguisitcs, August 2000.
[4]
G. Perrier.
Descriptions d'arbres avec polarités : les Grammaires d'Interaction, in: "9ième Conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'02), Nancy, France", 2002, p. 297–306.
[5]
P. de Groote.
Towards abstract categorial grammars, in: "Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Toulouse, France", July 2001, p. 148–155.
[6]
P. de Groote, F. Lamarche.
Classical Non Associative Lambek Calculus, in: "Studia Logica", August 2002, vol. 71, no 3, p. 355–388.

Doctoral dissertations and Habilitation theses

[7]
P. Jacobé de Naurois.
Completeness Results and Syntactic Characterizations of Complexity Classes over Arbitrary Structures, Thèse d'université, INPL, December 2004.

Articles in referred journals and book chapters

[8]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time, in: "Journal of Logic and Computation", November 2004,
http://www.loria.fr/publications/2004/A04-R-285/A04-R-285.ps.
[9]
J.-Y. Marion.
Editorial: Implicit Computational Complexity (ICC), in: "Theoretical Computer Science", Editeur scientifique invité, June 2004, vol. 318, no 1-2, 1.

Publications in Conferences and Workshops

[10]
J. Besombes, J.-Y. Marion.
Apprentissage des grammaires catégorielles à partir de structures, in: "Conférence Francophone d'Apprentissage - CAp'2004, Montpellier, France", Presse universitaire de Grenoble, June 2004, p. 315–330.
[11]
J. Besombes, J.-Y. Marion.
Learning Dependency Languages from a Teacher, in: "9th conference on Formal Grammar, Nancy, France", August 2004.
[12]
J. Besombes, J.-Y. Marion.
Learning regular trees with queries, in: "Intelligent Information Processing and Web Mining, Proceedings of the International IIS: IIPWM'04, Zakopane, Poland", M. A. Klopotek, S. T. Wierzchon, K. Trojanowski (editors)., Advances in Soft Computing, Springer, May 2004, p. 181–190.
[13]
J. Besombes, J.-Y. Marion.
Learning Reversible Categorial Grammars from Structures, in: "Categorial Grammars, Montpellier, France", June 2004.
[14]
J. Besombes, J.-Y. Marion.
Learning Tree Languages from Positive Examples and Membership Queries, in: "15th international conference on Algorithmic Learning Theory - ALT'2004, Padova, Italy", S. Ben-David, J. Case, A. Maruoka (editors)., Lecture notes in Artificial Intelligence, Springer, October 2004, vol. 3244, p. 440–453.
[15]
M. Bodirsky, D. Duchier, J. Niehren, S. Miele.
A New Algorithm For Normal Dominance Constraints, in: "ACM-SIAM Symposium on Discrete Algorithms - SODA'2003, New Orleans, LA, USA", January 2004.
[16]
G. Bonfante, B. Guillaume, G. Perrier.
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation, in: "20th Conference on Computational Linguistics - CoLing'2004, Geneva, Switzerland", August 2004, p. 303–309,
http://www.loria.fr/publications/2004/A04-R-260/A04-R-260.ps.
[17]
G. Bonfante, J.-Y. Marion, J.-Y. Moyen.
On complexity analysis by quasi-interpretation, in: "2nd Appsem II workshop - APPSEM'04, Tallinn, Estonia", April 2004, p. 85–95.
[18]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures, in: "3rd IFIP International Conference on Theoretical Computer Science - TCS'2004, Toulouse, France", Kluwer Academic Press, August 2004,
http://www.loria.fr/publications/2004/A04-R-287/A04-R-287.ps.
[19]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures, in: "2nd APPSEM II Workshop - APPSEM'2004, Tallinn, Estonia", April 2004,
http://www.loria.fr/publications/2004/A04-R-419/A04-R-419.ps.
[20]
D. Duchier, J. Le Roux, Y. Parmentier.
The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture, in: "Second International Mozart/Oz Conference - MOZ 2004, Charleroi, Belgium", October 2004.
[21]
J.-Y. Marion.
Resource Analysis by Quasi-Interpretations, in: "Sixth International Workshop on Logic and Computational Complexity, Turku, Finland", Neil Jones, July 2004,
http://www.loria.fr/publications/2004/A04-R-349/A04-R-349.ps.
[22]
G. Perrier.
La sémantique dans les grammaires d'interaction, in: "11ième Conférence annuelle sur le Traitement Automatique des Langues Naturelles - TALN'2004, Fès, Morocco", April 2004,
http://www.loria.fr/publications/2004/A04-R-259/A04-R-259.ps.
[23]
S. Pogodalla.
Computing Semantic Representation: Towards ACG Abstract Terms as Derivation Trees, in: "Seventh International Workshop on Tree Adjoining Grammar and Related Formalisms - TAG+7, Vancouver, BC, Canada", May 2004, p. 64–71,
http://www.loria.fr/publications/2004/A04-R-058/A04-R-058.ps.
[24]
S. Pogodalla.
Using and Extending the ACG technology: Endowing Categorial Grammars with an Underspecified Semantic Representation, in: "Categorial Grammars, Montpellier, France", June 2004, p. 197–209,
http://www.loria.fr/publications/2004/A04-R-155/A04-R-155.ps.
[25]
S. Pogodalla.
Vers un statut de l'arbre de dérivation: exemples de construction de représentations sémantiques pour les Grammaires d'Arbres Adjoints, in: "Traitement Automatique des Langues Naturelles - TALN'04, Fès, Morocco", April 2004,
http://www.loria.fr/publications/2004/A04-R-050/A04-R-050.ps.
[26]
L. Strassburger, F. Lamarche.
On Proof Nets for Multiplicative Linear Logic with Units, in: "18th International Workshop on Computer Science Logic - CSL'2004, Karpacz, Poland", J. Marcinkowski, A. Tarlecki (editors)., Lecture Notes in Computer Science, 13th Annual Conference of the EACSL, Springer-Verlag, September 2004, vol. 3210, p. 145–159.
[27]
P. de Groote, B. Guillaume, S. Salvati.
Vector Addition Tree Automata, in: "19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, Turku, Finland", July 2004, p. 64–73.
[28]
P. de Groote, S. Salvati.
Higher-order Matching in the Linear lambda-calculus with Pairing, in: "18th International Workshop on Computer Science Logic - CSL'2004, Karpacz, Poland", A. T. Jerzy Marcinkowski (editor)., Lecture notes in Computer Science, Springer, September 2004, vol. 3210, p. 220–234.

Internal Reports

[29]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Implicit Complexity over an Arbitrary Structure: Quantifier Alternations, Rapport de recherche, Loria, October 2004,
http://www.loria.fr/publications/2004/A04-R-300/A04-R-300.ps.
[30]
F. Lamarche, L. Strassburger.
From Proof nets to the Free *-Autonomous Categories, Rapport de recherche, Loria, November 2004,
http://www.loria.fr/publications/2004/A04-R-390/A04-R-390.ps.
[31]
F. Lamarche, L. Strassburger.
Naming Proofs in Classical Propositional Logic, Rapport de recherche, Loria, October 2004,
http://www.loria.fr/publications/2004/A04-R-391/A04-R-391.ps.

Bibliography in notes

[32]
Y. Bar-Hillel.
A quasi-arithmetical notation for syntactic description, in: "Language", 1950, vol. 29, p. 47-58.
[33]
S. Bellantoni.
Predicative recursion and the polytime hierarchy, in: "Feasible Mathematics II", P. Clote, J. Remmel (editors)., Perspectives in Computer Science, Birkhäuser, 1994.
[34]
S. Bellantoni, S. Cook.
A new recursion-theoretic characterization of the poly-time functions, in: "Computational Complexity", 1992, vol. 2, p. 97–110.
[35]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time, in: "Foundations of Software Science and Computation Structures - FOSSACS'03, Warsaw, Poland", A. D. Gordon (editor)., Lecture Notes in Computer Science, Springer, Apr 2003, vol. 2620, p. 185-199.
[36]
O. Bournez, F. Cucker, P. Jacobé de Naurois, J.-Y. Marion.
Safe Recursion Over an Arbitrary Structure : PAR, PH and DPH, in: "Fifth International Workshop on Implicit Computational Complexity - ICC'2003, Ottawa, Canada", Electronic Notes in Computer Science, Jun 2003, vol. 90, no 1.
[37]
H. Curry.
Foundations of mathematical logic, Dover Publications, 1977.
[38]
D. Duchier, R. Debusmann.
Topological Dependency Trees: A Constraint-based Account of Linear Precedence, in: "39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), Toulouse, France", 9–11July 2001.
[39]
D. Duchier.
Axiomatizing Dependency Parsing Using Set Constraints, in: "Sixth Meeting on Mathematics of Language, Orlando, Florida", July 1999, p. 115–126.
[40]
G. Gentzen.
Recherches sur la déduction logique (Untersuchungen über das logische schließen), Traduction et commentaire par R. Feys et J. Ladrière, Presses Universitaires de France, 1955.
[41]
J.-Y. Girard.
Linear Logic, in: "Theoretical Computer Science", 1987, vol. 50, p. 1-102.
[42]
T. G. Griffin.
A formulae-as-types notion of control, in: "Conference record of the seventeenth annual ACM symposium on Principles of Programming Languages", 1990, p. 47-58.
[43]
J. Lambek.
The mathematics of sentence structure, in: "Amer. Math. Monthly", 1958, vol. 65, p. 154-170.
[44]
J. Lambek.
On the calculus of syntactic types, in: "Studies of Language and its Mathematical Aspects, Providence", Proc. of the 12th Symp. Appl. Math.., 1961, p. 166-178.
[45]
D. Leivant, J.-Y. Marion.
Ramified recurrence and computational complexity II: substitution and poly-space, in: "Computer Science Logic, 8th Workshop, CSL '94, Kazimierz,Poland", L. Pacholski, J. Tiuryn (editors)., Lecture Notes in Computer Science, Springer, 1995, vol. 933, p. 486–500.
[46]
I. Mel'čuk.
Dependency Syntax: Theory and Practice, State Univ. Press of New York, Albany/NY, 1988.
[47]
J. Michaelis.
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars, in: "Proceedings of the conference Logical Aspects of Computational Linguistics (LACL `01)", LNCS/LNAI, 2001, vol. 2099.
[48]
G. Perrier.
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions, in: "8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2001, Havana, Cuba", A. V. Robert Nieuwenhuis (editor)., Lecture Notes in Artificial Intelligence, Springer, Dec 2001, vol. 2250, p. 233-248.
[49]
G. Perrier.
Descriptions d'arbres avec polarités  : les Grammaires d'Interaction, in: "9ième Conférence annuelle sur le Traitement Automatique des Langues Naturelles - TALN'02, Nancy, France", Jun 2002,
http://www.loria.fr/publications/2002/A02-R-123/A02-R-123.ps.
[50]
H. Seki, T. Matsumura, M. Fujii, T. Kasami.
On Multiple Context-Free Grammars, in: "Theoretical Computer Science", 1991, vol. 223, p. 87–120.
[51]
P. Sgall, L. Nebesky, A. Goralcikova, E. Hajicova.
A Functional Approach To Syntax In Generative Description Of Language, 1969.
[52]
L. Tesnière.
Eléments de Syntaxe Structurale, 1959.
[53]
K. Vijay-Shanker.
Using Description of Trees in a Tree Adjoining Grammar, in: "Computational Linguistics", 1992, vol. 18, no 4, p. 481-517.
[54]
D. J. Weir.
Characterizing Mildly Context-Sensitive Grammar Formalisms, Ph. D. Thesis, University of Pennsylvania, 1988.

previous
next