Rewrite Rule Systems for Modal Propositional Logic. - Annie Foret (J. Log. Program., 1992)

On Mixing Deduction and Substitution in Lambek Categorial Grammars. - Annie Foret (LACL, 2001)

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

Rigid Lambek Grammars Are Not Learnable from Strings. - Annie Foret; Yannick Le Nir (COLING, 2002)

On Limit Points for Some Variants of Rigid Lambek Grammars. - Annie Foret; Yannick Le Nir (ICGI, 2002)

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. - Denis Béchet; Annie Foret (ACL, 2003)

Remarques et perspectives sur les langages de prégroupe d'ordre 1/2. - Denis Béchet; Annie Foret (TALN (Posters), 2003)

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. - Denis Béchet; Annie Foret (WoLLIC, 2003)

Dependency Structure Grammars. - Denis Béchet; Alexander Ja. Dikovsky; Annie Foret (LACL, 2005)

k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. - Denis Béchet; Annie Foret (LACL, 2005)

k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. - Denis Béchet; Annie Foret (Theor. Comput. Sci., 2006)

Fully Lexicalized Pregroup Grammars. - Denis Béchet; Annie Foret (WoLLIC, 2007)

Pregroup Calculus as a Logic Functor. - Annie Foret (WoLLIC, 2007)

Learnability of Pregroup Grammars. - Denis Béchet; Annie Foret; Isabelle Tellier (Stud Logica, 2007)

Optional and Iterated Types for Pregroup Grammars. - Denis Béchet; Alexander Ja. Dikovsky; Annie Foret; Emmanuelle Garel (LATA, 2008)

Two Models of Learning Iterated Dependencies. - Denis Béchet; Alexander Ja. Dikovsky; Annie Foret (FG, 2010)

On Categorial Grammars as Logical Information Systems. - Annie Foret; Sébastien Ferré (ICFCA, 2010)

A modular and parameterized presentation of pregroup calculus. - Annie Foret (Inf. Comput., 2010)

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. - Denis Béchet; Alexander Ja. Dikovsky; Annie Foret (LACL, 2011)

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)

On Associative Lambek Calculus Extended with Basic Proper Axioms. - Annie Foret (Categories and Types in Logic, Language, and Physics, 2014)

On Harmonic CCG and Pregroup Grammars. - Annie Foret (LACL, 2014)

TermLis : un contexte d'information logique pour des ressources terminologiques. - Annie Foret (TALN (Demos), 2015)

A Logical Information System Proposal for Browsing Terminological Resources. - Annie Foret (TIA, 2015)

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 (EGC, 2016)

Simple K-star Categorial Dependency Grammars and their Inference. - Denis Béchet; Annie Foret (ICGI, 2016)

Categorial Dependency Grammars with Iterated Sequences. - Denis Béchet; Annie Foret (LACL, 2016)

Extracting ODRL Digital Right Representations from License Texts using AMR. - Malo Revel; Aurélien Lamercerie; Annie Foret; Zoltán Miklós 001 (ASAIL@ICAIL, 2023)

Incremental learning of iterated dependencies. - Denis Béchet; Annie Foret (Mach. Learn., 2024)