Search in ATOLL bibliography

all | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | PS|PDF|HTML BIB|Raw BIB|Submit

Year:

Type:

Search: (please use the notation of Alta Vista simple queries)

Key search


Année 2007

Communications à des congrés, colloques, etc.

[1]
Large-scale knowledge acquisition from botanical texts. In Proc. of NLDB'07, 2007.
François Role, Milagros Fernandez Gavilanes, and Éric Villemonte de la Clergerie.
[BibTeX]

[2]
Mining parsing results for lexical corrections. In Proc. of the 3rd Language & Technology Conference (LTC), Poznan, Poland, October 2007.
Lionel Nicolas, Jacques Farré, and Éric Villemonte de la Clergerie.
[BibTeX]

[3]
Confondre le coupable: Corrections d'un lexique suggérées par une grammaire. In Proc. of TALN'07, 2007.
Lionel Nicolas, Jacques Farré, and Éric Villemonte de la Clergerie.
[BibTeX]

[4]
Knowledge acquisition through error-mining. In Proc. of International Conference RANLP'07, Borovets, Bulgaria, 2007.
Milagros Fernandez, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX]

[5]
From text to knowledge. In Proc. of EUROCAST'07 (Eleven international conference on Computer Aided Systems theory), 2007.
Milagros Fernandez, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX]

Année 2006

Livres et monographies

[6]
Designing tabular parsers for various syntactic formalisms. The association for Logic, Language and Information (FOLLI), Malaga, Spain, July-August 2006. Tutorial delivered at the 18th European Summer School in Logic, language and information (ESSLLI'06),
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
The aim of this course is to introduce chart-based (or tabular) parsing techniques found in Natural Language Processing and to illustrate them on several large classes of syntactic formalisms (Context-Free Grammars, Unification-based grammars, Tree Adjoining Grammars [TAGs] with, possibly, generalizations to other Mildly-Context Sensitive formalisms). The course will focus on designing such tabular algorithms for new formalisms by providing some intuition about how they work and by examining complexity issues (both on theoretical and practical aspects). The course will also emphasize the notion of shared derivation forest as parsing output and its potential use, during or after parsing.

Communications à des congrés, colloques, etc.

[14]
Trouver le coupable : Fouille d'erreurs sur des sorties d'analyseurs syntaxiques. In Proc. of TALN'06, pages 287–296, 2006. Prix du meilleur papier,
Benoît Sagot and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
Nous présentons une méthode de fouille d'erreurs pour détecter automatiquement des erreurs dans les ressources utilisées par les systèmes d'analyse syntaxique. Nous avons mis en oeuvre cette méthode sur le résultat de l'analyse de plusieurs millions de mots par deux systèmes d'analyse différents qui ont toutefois en commun le lexique syntaxique et la chaîne de traitement pré-syntaxique. Nous avons pu identifier ainsi des inexactitudes et des incomplétudes dans les ressources utilisées. En particulier, la comparaison des résultats obtenus sur les sorties des deux analyseurs sur un même corpus nous a permis d'isoler les problèmes issus des ressources partagées de ceux issus des grammaires.


[15]
Error mining in parsing results. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 329–336, Sydney, Australia, July 2006. Association for Computational Linguistics.
Benoît Sagot and Éric Villemonte de La Clergerie.
[BibTeX] [URL] [Slides]

[17]
The Lefff 2 syntactic lexicon for french: architecture, acquisition, use. In Proc. of LREC'06, 2006.
Benoît Sagot, Lionel Clément, Éric Villemonte de La Clergerie, and Pierre Boullier.
[BibTeX] [PDF]

Divers

[21]
Mining errors in large corpus parsing output, March 2006. Slides presented at Univ. of Vigo, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[22]
From meta-grammars to factorized grammars, March 2006. Slides presented at Univ. of La Coruña, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[23]
Atoll: Software tools for natural language processing, March 2006. Slides presented at Univ. of Vigo, Spain,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

Année 2005

Communications à des congrés, colloques, etc.

[34]
From metagrammars to factorized TAG/TIG parsers. In Proceedings of IWPT'05 (poster), pages 190–191, Vancouver, Canada, October 2005.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[35]
DyALog: a tabular logic programming based environment for NLP. In Proceedings of 2nd International Workshop on Constraint Solving and Language Processing (CSLP'05), Barcelona, Spain, October 2005.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[36]
Comment obtenir plus des méta-grammaires. In Proceedings of TALN'05, Dourdan, France, June 2005. ATALA.
François Thomasset and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[41]
Analyse automatique de documents botaniques: le projet Biotim. In proc. of TIA'05, pages 95–104, Rouen, France, April 2005.
Guillaume Rousse and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[45]
MAF: a morphosyntactic annotation framework. In proc. of the 2nd Language & Technology Conference (LT'05), pages 90–94, Poznan, Poland, April 2005.
Lionel Clément and Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[48]
« simple comme easy :-) ». In Proceedings of TALN'05 EASy Workshop (poster), pages 57–60, Dourdan, France, June 2005. ATALA.
Pierre Boullier, Lionel Clément, Benoît Sagot, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

[49]
Chaînes de traitement syntaxique. In Proceedings of TALN'05, pages 103–112, Dourdan, France, June 2005. ATALA.
Pierre Boullier, Lionel Clément, Benoît Sagot, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

Rapports de recherche et publications internes

[51]
Terminology and other language resources – morpho-syntactic annotation framework (MAF). Committe Draft ISO TC37 SC4 WG2 N119 Rev3, ISO, October 2005. Submitted for CD ballot,
Éric Villemonte de La Clergerie.
[BibTeX]
A preliminary proposal to standardize morphosyntactic annotations.

Divers

[52]
From meta-grammars to factorized grammars, October 2005. Slides presented at IULA, Universitat Pompeu Fabra, Barcelona,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

[53]
Concevoir des analyseurs syntaxiques avec dyalog à partir de méta-grammaires, January 2005. Slides presented at TALaNa, University Paris 7,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[54]
Vers un méta-lexique pour le français : architecture, acquisition, utilisation. Journée d'étude de l'ATALA sur l'Interface lexique-grammaire et lexiques syntaxiques et sémantiques, March 2005,
Benoît Sagot, Lionel Clément, Éric Villemonte de La Clergerie, and Pierre Boullier.
[BibTeX] [PDF]

Année 2004

Articles et chapitres de livre

[57]
Relating Tabular Parsing Algorithms for LIG and TAG, volume 23 of Text, Speech and Language Technology, pages 157–184. Kluwer Academic Publishers, 2004. revised notes of a paper for IWPT2000,
Miguel A. Alonso, Éric Villemonte de La Clergerie, Vítor J. Diaz, and Manuel Vilares.
[BibTeX] [PDF]

Rapports de recherche et publications internes

[64]
Terminology and other language resources – morpho-syntactic annotation framework (MAF). Working Draft ISO TC37 SC4 WG2 N119 Rev2, ISO, July 2004.
Lionel Clément and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]
A preliminary proposal to standardize morphosyntactic annotations.

Divers

[65]
Designing efficient parsers with DyALog, June 2004. Slides presented at GLINT, Universidade Nova de Lisboa,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

Année 2003

Livres et monographies

[69]
Éric Villemonte de La Clergerie and Martin Rajman, editors. Evolutions en Analyse Syntaxique, volume 44 of Traitement Automatique des Langues (T.A.L.). Hermes - Lavoisier, 2003.
[BibTeX]

Articles et chapitres de livre

[70]
Petit panorama des approches en analyse syntaxique. Traitement Automatique des Langues (T.A.L.), 44(3):7–14, 2003.
Éric Villemonte de La Clergerie and Martin Rajman.
[BibTeX] [PDF]

Communications à des congrés, colloques, etc.

[74]
International standard for a linguistic annotation framework. In Proceedings of HLT-NAACL'03 Workshop on The Software Engineering and Architecture of Language Technology, 2003. Journal version submitted to the special issue of JNLE on Software Architecture for Language Engineering,
N. Ide, L. Romary, and Éric Villemonte de La Clergerie.
[BibTeX] [PDF]

Divers

[80]
Thread automata for mildly context-sensitive languages, May 2003. Slides presented at IRCS, University of Pennsylvania,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

Année 2002

Communications à des congrés, colloques, etc.

[85]
Parsing mildly context-sensitive languages with thread automata. In Proc. of COLING'02, August 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[86]
Parsing MCS languages with thread automata. In Proc. of TAG+6, May 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]

[87]
Construire des analyseurs avec DyALog. In Proc. of TALN'02, June 2002.
Éric Villemonte de La Clergerie.
[BibTeX] [PDF] [Slides]
Cet article survole les fonctionnalités offertes par le système DyALog pour construire des analyseurs syntaxiques tabulaires. Offrant la richesse d'un environnement de programmation en logique, DyALog facilite l'écriture de grammaires, couvre plusieurs formalismes et permet le paramétrage de stratégies d'analyse.
This paper is a survey of the functionalities provided by system DyALog to build tabular parsers. Providing the expressiveness of logic programming, DyALog eases the development of grammars, covers several linguistic formalisms, and allows the parametrization of parsing strategies.


Année 2001

Articles et chapitres de livre

[93]
Tabulation for multi-purpose parsing. Grammars, 4(1):41–65, 2001.
Vitor Jorge Rocio, Gabriel Pereira Lopes, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]

[96]
A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique. In Philippe de Groote, Glyn Morril, and Christian Retoré, editors, Logical Aspects of Computational Linguistics (LACL'01), volume 2099 of Lecture Notes in Artificial Intelligence, pages 44–61. Springer-Verlag, Berlin-Heidelberg-New York, 2001.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Communications à des congrés, colloques, etc.

[97]
Refining tabular parsers for TAGs. In Proceedings of NAACL'01, pages 167–174, CMU, Pittsburgh, PA, USA, June 2001.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
This paper investigates several refinements of a generic tabular parser for Tree Adjoining Grammars. The resulting parser is simpler and more efficient in practice, even though the worst case complexity is not optimal.


[101]
Guided parsing of range concatenation languages. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL'01), pages 42–49, University of Toulouse, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, and Éric Villemonte de La Clergerie.
[BibTeX]

[102]
Atelier ATOLL pour les grammaires d'arbres adjoints. In Proceedings of TALN'01, pages 63–72, Tours, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
Cet article présente l'environnement de travail que nous développons au sein de l'équipe ATOLL pour les grammaires d'arbres adjoints. Cet environnement comprend plusieurs outils et ressources fondés sur l'emploi du langage de balisage XML. Ce langage facilite la mise en forme et l'échange de ressources linguistiques.


[103]
Tools and resources for tree adjoining grammars. In Proceedings of ACL'01 workshop on Sharing Tools and Resources, pages 63–70, Toulouse, France, July 2001.
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, Abdelaziz Khajour, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]
This paper presents a workbench for Tree Adjoining Grammars that we are currently developing. This workbench includes several tools and resources based on the markup language XML, used as a convenient language to format and exchange linguistic resources.

Divers

[105]
Natural language tabular parsing. Slides for a tutorial delivered at ICLP'01, November 2001,
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed] [Slides]

[106]
ATOLL TAG workbench, May 2001. Slides presented at IRCS, University of Pennsylvania,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

Année 2000

Livres et monographies

[109]
Philippe Blache and Éric Villemonte de La Clergerie, editors. Actes de la Journée ATALA "Représentation et traitement de l'ambiguité pour l'analyse syntaxique". ATALA, INRIA, January 2000.
[BibTeX] [URL]

Articles et chapitres de livre

[112]
Tabulation of automata for tree-adjoining languages. Grammars, 3(23), 2000.
Mark-Jan Nederhof, Miguel A. Alonso Pardo, and Éric Villemonte de La Clergerie.
[BibTeX]

Communications à des congrés, colloques, etc.

[118]
Créer, extraire et manipuler des forêts partagées avec DyALog. In Philippe Blache and Éric Villemonte de La Clergerie, editors, Actes de la Journée ATALA "Représentation et traitement de l'ambiguité pour l'analyse syntaxique". ATALA, INRIA, January 2000.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
Cet article explicite la nature des forêts d'analyse dans le cadre de grammaires d'unification, de programmes logiques et des grammaires TAG. Nous montrons comment ces forêts peuvent être représentées et extraites d'une execution avec le système DyALog.


[122]
Shared forests can guide parsing. In Proc. of 2nd workshop on Tabulation in Parsing and Deduction (TAPD'00), pages 165–174, Vigo, Spain, September 2000.
François Barthélemy, Pierre Boullier, Philippe Deschamp, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describes an experiment we have made in order to illustrate a promising method to speed up parsing. A first tabular parser, built from the syntactic skeleton of a unification grammar, parses a sentence and produces a shared forest. This forest is used to guide and speed-up a second tabular parser which performs the unification checks.


[123]
A redefinition of Embedded Push-Down Automata. In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 19–26, Université Paris 7, Jussieu, Paris, France, May 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX] [PS Compressed]

[124]
A formal definition of bottom-up embedded push-down automata and their tabulation techniques. In Proc. of 2nd workshop on Tabulation in Parsing and Deduction (TAPD'00), pages 101–112, Vigo, Spain, September 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, and Manuel Vilares.
[BibTeX] [PS Compressed]

[125]
New tabular algorithms for LIG parsing. In Proceedings of the 6th International Workshop on Parsing Technologies (IWPT2000), pages 29–40, Trento, Italy, February 2000.
Miguel A. Alonso Pardo, Éric Villemonte de La Clergerie, Jorge Graña, and Manuel Vilares.
[BibTeX] [PS Compressed]
We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.


[126]
Practical aspects in compiling tabular TAG parsers. In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 27–32, Université Paris 7, Jussieu, Paris, France, May 2000.
Miguel A. Alonso Pardo, Djamé Seddah, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describes the extension of the system DyALog to compile tabular parsers from Feature Tree Adjoining Grammars. The compilation process uses intermediary 2-stack automata to encode various parsing strategies and a dynamic programming interpretation to break automata derivations into tabulable fragments.

Divers

[128]
Tabulation for natural language processing(slides). September 2000,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]
Slide for an invited presentation at SEPLN'00 (Vigo, Spain).


[130]
Tools and resources for tree adjoining grammars. Présenté au groupe de travail TAGML, October 2000,
François Barthélemy, Pierre Boullier, Philippe Deschamp, Linda Kaouane, and Éric Villemonte de La Clergerie.
[BibTeX]

Année 1999

Livres et monographies

[131]
Tabulation et traitement de la langue. ATALA, Cargèse, Corse, France, July 1999. Tutoriel présenté à la 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99),
Éric Villemonte de La Clergerie.
[BibTeX] [URL]

Communications à des congrés, colloques, etc.

[138]
Vers un analyseur syntaxique parallèle. In Proc. of the Fourth International Symposium on Economic Informatics, pages 71–79, Bucharest, Romania, May 1999.
Isabelle Debourges, Gaétan Hains, Sylvie Guilloré, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
Le Traitement Automatique des Langues Naturelles (TALN) est un domaine de recherche en pleine expansion. DyALog, analyseur syntaxique généralisé s'inscrit dans ce cadre. L'ambiguité des grammaires à traiter dans le cas de telles applications conduit à un délai de réponse très long. L'objectif de l'étude de parallélisation était de réduire la complexité du logiciel en vue d'une application à des grammaires du Langage Naturel. L'étude complète de parallélisation de DyALog montre qu'il existe des algorithmes capables d'accélérer considérablement son exécution.


[143]
Tabulation of automata for tree adjoining languages. In Sixth Meeting on Mathematics of Language (MOL6), 1999.
Miguel A. Alonso Pardo, David Cabrero Souto, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper provides a common framework to clarify the relationships between different automata and their associated tabulation techniques for Tree Adjoning Languages, a subclass of Mildly Context-Sensitive Languages. We have chosen Logic Push-down Automata working with Linear Indexed Grammars as a starting point. Several tabulation techniques for different parsing strategies are proposed and compared with previous approaches.


[144]
Tabular algorithms for TAG parsing. In Proc. of EACL'99, 1999.
Miguel A. Alonso Pardo, David Cabrero Souto, Manuel Vilares, and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper describe several tabular algorithms for Tree Adjoining Grammar parsing, creating a continuum from simple pure bottom-up algorithms to complex predictive algorithms and showing what transformations must be applied to each one in order to obtain the next one in the continuum.

Divers

[149]
Multilingual terminology production through an intermediate knowledge level: Knowledge acquisition methods and techniques. Tâche 3.3.2 du Projet LE4-8356 Term–IT, devant être inclus dans le document D3.1, June 1999,
Éric Villemonte de La Clergerie.
[BibTeX]

[150]
Construire des analyseurs syntaxiques tabulaires avec le système DyALog (slides). slides in French presented at the workshop "Outils pour le traitement automatique des langues" organized by ATALA and GdR I3, November 1999,
Éric Villemonte de La Clergerie.
[BibTeX] [Slides]

Année 1998

Livres et monographies

[153]
Éric Villemonte de La Clergerie, editor. Tabulation in Parsing and Deduction (TAPD'98). CNAM, 1998.
[BibTeX] [URL]

Articles et chapitres de livre

[155]
Information flow in tabular interpretations for generalized push-down automata. Theoretical Computer Science, 199:167–198, 1998.
François Barthélemy and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
This paper presents a general framework for deriving tabular algorithms for a very large class of stack-based computations, not only in context-free parsing but in logic programming as well and more generally for all kinds of “information” domains (abstract domains, constraint domains). Tabular algorithms store traces of computations in a table to achieve computation sharing, which is most useful when dealing with non-deterministic computations. By considering what can be naively described as partial information on stack elements, we interpret these traces as stack fragments. Tuning the exact amount of information present in these traces allows us to improve tabular evaluation of stack-based computations, both by increasing the sharing of partial computations and by unifying different tabular algorithms within the same framework.


[156]
Algoritmos tabulares para el análisis de TAG. Procesamiento del Languaje Natural, 23:157–164, September 1998.
Miguel A. Alonso Pardo, David Cabrero Souto, Éric Villemonte de La Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Communications à des congrés, colloques, etc.

[158]
A tabular interpretation of bottom-up automata for TAG. In Proc. of Workshop TAG+4, 1998.
Éric Villemonte de La Clergerie, Miguel A. Alonso Pardo, and David Cabrero Souto.
[BibTeX] [PS Compressed]
The paper presents a tabular interpretation for Bottom-up 2-Stack Automata, which can describe parsing strategies for TAG and LIG where predictions are forbidden in one of the stacks. The results are also useful for tabulating other existing bottom-up automata models for this kind of languages.


[159]
A tabular interpretation of a class of 2-stack automata. In Proc. of ACL/COLING'98, August 1998.
Éric Villemonte de La Clergerie and Miguel A. Alonso Pardo.
[BibTeX] [PS Compressed] [Slides]
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to purely bottom-up, for LIGs and TAGs. The tabular interpretation ensures, for all strategies, a time complexity in O(n6) and space complexity in O(n5) where n is the length of the input string.


Année 1997

Articles et chapitres de livre

[169]
Logical aspect of conputational linguistics: An introduction. In C. Rétoré, editor, Logical Aspects of Computational Linguistics, number 1328 in Lecture Notes in Artificial Intelligence, pages 1–20. Springer, 1997.
P. Blackburn, M. Dymetman, A. Lecomte, A. Ranta, C. Rétoré, and Éric Villemonte de La Clergerie.
[BibTeX]

Communications à des congrés, colloques, etc.

[171]
Automata-based parsing in dynamic programming for Linear Indexed Grammars. In A. S. Narin'yani, editor, Proc. of DIALOGUE'97 Computational Linguistics and its Applications International Workshop, pages 22–27, Moscow, Russia, June 1997.
Miguel A. Alonso Pardo, Éric Villemonte de la Clergerie, and Manuel Vilares Ferro.
[BibTeX] [PS Compressed]

Année 1994

Communications à des congrés, colloques, etc.

[180]
LPDA: Another look at tabulation in logic programming. In Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP'94), pages 470–486. MIT Press, June 1994.
Éric Villemonte de La Clergerie and Bernard Lang.
[BibTeX] [PS Compressed]
The Logic Push-Down Automaton (LPDA) is introduced as an abstract operational model for the evaluation of logic programs. The LPDA can be used to describe a significant number of evaluation strategies, ranging from the top-down OLD strategy to bottom-up strategies, with or without prediction. Two types of dynamic programming, i.e. tabular, interpretation are defined, one being more efficient but restricted to a subclass of LPDAs. We propose to evaluate a logic program by first compiling it into a LPDA according to some chosen evaluation strategy, and then applying a tabular interpreter to this LPDA. This approach offers great flexibility and generalizes the magic-set transformations. It explains in a more intuitive way some known magic-set variants and their limits, and also suggests new developments.

Année 1993

Thèses et habilitations à diriger des recherches

[182]
Automates à piles et programmation dynamique. DyALog : Une application à la programmation en logique. PhD thesis, Université Paris 7, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [URL]

Communications à des congrés, colloques, etc.

[183]
Layer sharing : an improved structure–sharing framework. In Proc. of POPL'93, pages 345–356, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
We present in this paper a structure–sharing framework originally developed for a Dynamic Programming interpreter of Logic Programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub–computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the “magic-set” models, and the independent AND and OR parallelism with solution sharing models. These models raise the problem of storing vast amount of data, motivating us to discard copying mechanisms in favor of structure–sharing mechanisms. Unfortunately, computation sharing requires joining computation branches and possibly renaming some variables, which generally leads to complex structure–sharing mechanisms. The proposed “layer–sharing” framework succeeds however in remaining understandable and easy to implement.


[184]
How to build quickly an efficient implementation of the domain Prop with DyALog. In Proc. of the 5th workshop on Logic Programming Environments, ILPS'93, 1993.
Philippe Lefèbvre and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
DyALog, a tabular logic program evaluator with a modular architecture, is used to develop quickly an efficient interpreter for logic programs with boolean constraints [CLP(Bool) programs]. This is done by a coupling DyALOg with PECOS, a constraint solver over finite domains. This experiment, done in the context of Abstract Interpretation of logic programs, illustrates the “genericity” of our approach for developing interpretations on various abstract domains and for various semantics.

Année 1992

Communications à des congrés, colloques, etc.

[186]
Subsumption–oriented Push–Down Automata. In Springer-Verlag, editor, Proc. of PLILP'92, pages 100–114, 1992.
François P. Barthélemy and Éric. Villemonte de la Clergerie.
[BibTeX] [PS Compressed]
This paper presents Subsumption–oriented Push–Down Automata (SPDA), a very general stack formalism used to describe forest (“AND–OR” tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub–computations. They provide computation sharing and operational completeness and solves some of the problems posed by the usual depth–first, left–to–right traversals (as implemented in PROLOG). We give an axiomatization of SPDA and two examples of their use: the evaluation of logic programs and parsing with Tree Adjoining Grammars. SPDA may also serve in other areas such as Constraint Logic Programming, Abstract Interpretations, or Contextual parsing.

Année 1991

Communications à des congrés, colloques, etc.

[188]
A tool for abstract interpretation : Dynamic programming. In Actes JTASPEFL'91, pages 151–156, Bordeaux (FRANCE), October 1991.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
We briefly recall principal abstract interpretation evaluation algorithms for Logic Programs before presenting DyALog, a Logic Programs Dynamic Programming interpreter likely to be an interesting generic abstract interpretation framework. DyALog ensures answer completeness, termination for finite domains, and computation sharing. Major resolution strategies can be simulated.

Année 1990

Communications à des congrés, colloques, etc.

[189]
DyALog : une implantation des clauses de Horn en programmation dynamique. In Proc. of the 9th Séminaire de Programmation en Logique, pages 207–228. CNET, May 1990.
Éric Villemonte de La Clergerie.
[BibTeX]

Année 1989

Divers

[190]
Automates, programmation dynamique et evaluation de programmes logiques. Mémoire de DEA, Université Paris 7, September 1989.
Éric Villemonte de La Clergerie.
[BibTeX]

Eric de la Clergerie
Home Page