Annie Foret

According to our database, Annie Foret authored at least 28 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Extracting ODRL Digital Right Representations from License Texts using AMR.

Malo Revel, Aurélien Lamercerie, Annie Foret, Zoltán Miklós

Proceedings of the 6th Workshop on Automated Semantic Analysis of Information in Legal Text co-located with the 19th International Conference on Artificial Intelligence and Law (ICAIL 2023), 2023

2016

Categorial Dependency Grammars with Iterated Sequences.

Denis Béchet, Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

Simple K-star Categorial Dependency Grammars and their Inference.

Denis Béchet, Annie Foret

Proceedings of the 13th International Conference on Grammatical Inference, 2016

Exploration des Données du Défi EGC 2016 à l'aide d'un Système d'Information Logique.

Peggy Cellier, Sébastien Ferré, Annie Foret, Olivier Ridoux

Proceedings of the 16ème Journées Francophones Extraction et Gestion des Connaissances, 2016

2015

A Logical Information System Proposal for Browsing Terminological Resources.

Annie Foret

Proceedings of the 11th International Conference on Terminology and Artificial Intelligence, 2015

TermLis : un contexte d'information logique pour des ressources terminologiques.

Annie Foret

Proceedings of the Actes de la 22e conférence sur le Traitement Automatique des Langues Naturelles. Démonstrations, 2015

2014

On Harmonic CCG and Pregroup Grammars.

Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics, 2014

On Associative Lambek Calculus Extended with Basic Proper Axioms.

Annie Foret

Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2012

Categorial grammars with iterated types form a strict hierarchy of k-valued languages.

Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret

Theor. Comput. Sci., 2012

2011

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types.

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics, 2011

2010

A modular and parameterized presentation of pregroup calculus.

Annie Foret

Inf. Comput., 2010

On Categorial Grammars as Logical Information Systems.

Annie Foret, Sébastien Ferré

Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

Two Models of Learning Iterated Dependencies.

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret

Proceedings of the Formal Grammar, 2010

2008

Optional and Iterated Types for Pregroup Grammars.

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Learnability of Pregroup Grammars.

Denis Béchet, Annie Foret, Isabelle Tellier

Stud Logica, 2007

Pregroup Calculus as a Logic Functor.

Annie Foret

Proceedings of the Logic, 2007

Fully Lexicalized Pregroup Grammars.

Denis Béchet, Annie Foret

Proceedings of the Logic, 2007

2006

<i>k</i>-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.

Denis Béchet, Annie Foret

Theor. Comput. Sci., 2006

2005

k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.

Denis Béchet, Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics, 2005

Dependency Structure Grammars.

Denis Béchet, Alexander Ja. Dikovsky, Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.

Denis Béchet, Annie Foret

Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

Remarques et perspectives sur les langages de prégroupe d'ordre 1/2.

Denis Béchet, Annie Foret

Proceedings of the Actes de la 10ème conférence sur le Traitement Automatique des Langues Naturelles. Posters, 2003

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.

Denis Béchet, Annie Foret

Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003

2002

On Limit Points for Some Variants of Rigid Lambek Grammars.

Annie Foret, Yannick Le Nir

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Rigid Lambek Grammars Are Not Learnable from Strings.

Annie Foret, Yannick Le Nir

Proceedings of the 19th International Conference on Computational Linguistics, 2002

2001

The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable.

Annie Foret

Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), 2001

On Mixing Deduction and Substitution in Lambek Categorial Grammars.

Annie Foret

Proceedings of the Logical Aspects of Computational Linguistics, 2001

1992

Rewrite Rule Systems for Modal Propositional Logic.

Annie Foret

J. Log. Program., 1992