The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Annie Foret: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Denis Bechet, Annie Foret
    k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. [Citation Graph (0, 0)][DBLP]
    ACL, 2003, pp:351-358 [Conf]
  2. Annie Foret
    Rewrite Rule Systems for Modal Propositional Logic. [Citation Graph (0, 0)][DBLP]
    ALP, 1988, pp:147-156 [Conf]
  3. Annie Foret, Yannick Le Nir
    Rigid Lambek Grammars Are Not Learnable from Strings. [Citation Graph (0, 0)][DBLP]
    COLING, 2002, pp:- [Conf]
  4. Annie Foret, Yannick Le Nir
    On Limit Points for Some Variants of Rigid Lambek Grammars. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:106-119 [Conf]
  5. Denis Bechet, Annie Foret, Isabelle Tellier
    Learnability of Pregroup Grammars. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:65-76 [Conf]
  6. Denis Bechet, Alexander Ja. Dikovsky, Annie Foret
    Dependency Structure Grammars. [Citation Graph (0, 0)][DBLP]
    LACL, 2005, pp:18-34 [Conf]
  7. Denis Bechet, Annie Foret
    k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. [Citation Graph (0, 0)][DBLP]
    LACL, 2005, pp:1-17 [Conf]
  8. Annie Foret
    On Mixing Deduction and Substitution in Lambek Categorial Grammars. [Citation Graph (0, 0)][DBLP]
    LACL, 2001, pp:158-174 [Conf]
  9. Denis Bechet, Annie Foret
    k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:84, n:, pp:- [Journal]
  10. Annie Foret
    The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:53, n:, pp:- [Journal]
  11. Annie Foret
    Rewrite Rule Systems for Modal Propositional Logic. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:12, n:3&4, pp:281-298 [Journal]
  12. Denis Bechet, Annie Foret
    k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:2, pp:139-152 [Journal]
  13. Denis Bechet, Annie Foret
    Fully Lexicalized Pregroup Grammars. [Citation Graph (0, 0)][DBLP]
    WoLLIC, 2007, pp:12-25 [Conf]
  14. Annie Foret
    Pregroup Calculus as a Logic Functor. [Citation Graph (0, 0)][DBLP]
    WoLLIC, 2007, pp:147-161 [Conf]

  15. On Categorial Grammars as Logical Information Systems. [Citation Graph (, )][DBLP]


  16. Optional and Iterated Types for Pregroup Grammars. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002