2008 |
16 | EE | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret,
Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars.
LATA 2008: 88-100 |
2007 |
15 | EE | Denis Béchet,
Annie Foret:
Fully Lexicalized Pregroup Grammars.
WoLLIC 2007: 12-25 |
14 | EE | Annie Foret:
Pregroup Calculus as a Logic Functor.
WoLLIC 2007: 147-161 |
13 | EE | Denis Béchet,
Annie Foret,
Isabelle Tellier:
Learnability of Pregroup Grammars.
Studia Logica 87(2-3): 225-252 (2007) |
2006 |
12 | EE | 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 | EE | Denis Béchet,
Annie Foret:
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
LACL 2005: 1-17 |
10 | EE | Denis Béchet,
Alexander Ja. Dikovsky,
Annie Foret:
Dependency Structure Grammars.
LACL 2005: 18-34 |
2004 |
9 | EE | Denis Béchet,
Annie Foret,
Isabelle Tellier:
Learnability of Pregroup Grammars.
ICGI 2004: 65-76 |
2003 |
8 | EE | Denis Béchet,
Annie Foret:
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.
ACL 2003: 351-358 |
7 | EE | Denis Béchet,
Annie Foret:
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
2002 |
6 | EE | Annie Foret,
Yannick Le Nir:
Rigid Lambek Grammars Are Not Learnable from Strings.
COLING 2002 |
5 | EE | Annie Foret,
Yannick Le Nir:
On Limit Points for Some Variants of Rigid Lambek Grammars.
ICGI 2002: 106-119 |
2001 |
4 | EE | Annie Foret:
On Mixing Deduction and Substitution in Lambek Categorial Grammars.
LACL 2001: 158-174 |
3 | EE | 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: (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 |