Annie Foret

	2011
20		Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret: Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52
19		Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95
	2010
18		Annie Foret, Sébastien Ferré: On Categorial Grammars as Logical Information Systems. ICFCA 2010: 225-240
17		Annie Foret: A modular and parameterized presentation of pregroup calculus. Inf. Comput. 208(5): 510-520 (2010)
	2008
16		Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel: Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100
	2007
15		Denis Béchet, Annie Foret: Fully Lexicalized Pregroup Grammars. WoLLIC 2007: 12-25
14		Annie Foret: Pregroup Calculus as a Logic Functor. WoLLIC 2007: 147-161
13		Denis Béchet, Annie Foret, Isabelle Tellier: Learnability of Pregroup Grammars. Studia Logica 87(2-3): 225-252 (2007)
	2006
12		Denis Béchet, Annie Foret: k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. Theor. Comput. Sci. 355(2): 139-152 (2006)
	2005
11		Denis Béchet, Annie Foret: k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. LACL 2005: 1-17
10		Denis Béchet, Alexander Ja. Dikovsky, Annie Foret: Dependency Structure Grammars. LACL 2005: 18-34
	2004
9		Denis Béchet, Annie Foret, Isabelle Tellier: Learnability of Pregroup Grammars. ICGI 2004: 65-76
	2003
8		Denis Béchet, Annie Foret: k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. ACL 2003: 351-358
7		Denis Béchet, Annie Foret: k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. Electr. Notes Theor. Comput. Sci. 84: 60-72 (2003)
	2002
6		Annie Foret, Yannick Le Nir: Rigid Lambek Grammars Are Not Learnable from Strings. COLING 2002
5		Annie Foret, Yannick Le Nir: On Limit Points for Some Variants of Rigid Lambek Grammars. ICGI 2002: 106-119
	2001
4		Annie Foret: On Mixing Deduction and Substitution in Lambek Categorial Grammars. LACL 2001: 158-174
3		Annie Foret: The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable. Electr. Notes Theor. Comput. Sci. 53: 81-93 (2001)
	1992
2		Annie Foret: Rewrite Rule Systems for Modal Propositional Logic. J. Log. Program. 12(3&4): 281-298 (1992)
	1988
1		Annie Foret: Rewrite Rule Systems for Modal Propositional Logic. ALP 1988: 147-156

Coauthor Index

1	Denis Béchet	[7] [8] [9] [10] [11] [12] [13] [15] [16] [19] [20]
2	Alexander Ja. Dikovsky	[10] [16] [19]
3	Alexandre Ja. Dikovsky	[20]
4	Sébastien Ferré	[18]
5	Emmanuelle Garel	[16]
6	Yannick Le Nir	[5] [6]
7	Isabelle Tellier	[9] [13]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page