Annie Foret
According to our database1,
Annie Foret
authored at least 29 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
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
Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016
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.
Proceedings of the 16ème Journées Francophones Extraction et Gestion des Connaissances, 2016
2015
Proceedings of the 11th International Conference on Terminology and Artificial Intelligence, 2015
Proceedings of the Actes de la 22e conférence sur le Traitement Automatique des Langues Naturelles. Démonstrations, 2015
2014
Proceedings of the Logical Aspects of Computational Linguistics, 2014
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.
Theor. Comput. Sci., 2012
2011
Proceedings of the Logical Aspects of Computational Linguistics, 2011
2010
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010
Proceedings of the Formal Grammar, 2010
2008
Proceedings of the Language and Automata Theory and Applications, 2008
2007
2006
<i>k</i>-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.
Theor. Comput. Sci., 2006
2005
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
Proceedings of the Logical Aspects of Computational Linguistics, 2005
Proceedings of the Logical Aspects of Computational Linguistics, 2005
2003
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003
Proceedings of the Actes de la 10ème conférence sur le Traitement Automatique des Langues Naturelles. Posters, 2003
Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003
2002
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002
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.
Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), 2001
Proceedings of the Logical Aspects of Computational Linguistics, 2001
1992