default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnie Foret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Denis Béchet
, Annie Foret:
Incremental learning of iterated dependencies. Mach. Learn. 113(5): 2841-2875 (2024)- 2023
- [c26]Malo Revel, Aurélien Lamercerie, Annie Foret, Zoltán Miklós:
Extracting ODRL Digital Right Representations from License Texts using AMR. ASAIL@ICAIL 2023: 151-157
2010 – 2019
- 2018
- [e3]Annie Foret, Reinhard Muskens, Sylvain Pogodalla:
Formal Grammar - 22nd International Conference, FG 2017, Toulouse, France, July 22-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10686, Springer 2018, ISBN 978-3-662-56342-7 [contents] - [e2]Annie Foret, Gregory M. Kobele, Sylvain Pogodalla:
Formal Grammar 2018 - 23rd International Conference, FG 2018, Sofia, Bulgaria, August 11-12, 2018, Proceedings. Lecture Notes in Computer Science 10950, Springer 2018, ISBN 978-3-662-57783-7 [contents] - 2016
- [c25]Peggy Cellier, Sébastien Ferré, Annie Foret, Olivier Ridoux:
Exploration des Données du Défi EGC 2016 à l'aide d'un Système d'Information Logique. EGC 2016: 443-448 - [c24]Denis Béchet, Annie Foret:
Simple K-star Categorial Dependency Grammars and their Inference. ICGI 2016: 3-14 - [c23]Denis Béchet, Annie Foret:
Categorial Dependency Grammars with Iterated Sequences. LACL 2016: 34-51 - [e1]Annie Foret, Glyn Morrill, Reinhard Muskens, Rainer Osswald, Sylvain Pogodalla:
Formal Grammar - 20th and 21st International Conferences, FG 2015, Barcelona, Spain, August 2015, Revised Selected Papers. FG 2016, Bozen, Italy, August 2016, Proceedings. Lecture Notes in Computer Science 9804, Springer 2016, ISBN 978-3-662-53041-2 [contents] - 2015
- [c22]Annie Foret:
TermLis : un contexte d'information logique pour des ressources terminologiques. TALN (Demos) 2015: 8-9 - [c21]Annie Foret:
A Logical Information System Proposal for Browsing Terminological Resources. TIA 2015: 51-59 - 2014
- [c20]Annie Foret:
On Associative Lambek Calculus Extended with Basic Proper Axioms. Categories and Types in Logic, Language, and Physics 2014: 172-187 - [c19]Annie Foret:
On Harmonic CCG and Pregroup Grammars. LACL 2014: 83-95 - 2012
- [j5]Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret:
Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theor. Comput. Sci. 450: 22-30 (2012) - 2011
- [c18]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95 - [c17]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52 - 2010
- [j4]Annie Foret:
A modular and parameterized presentation of pregroup calculus. Inf. Comput. 208(5): 510-520 (2010) - [c16]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Two Models of Learning Iterated Dependencies. FG 2010: 17-32 - [c15]Annie Foret, Sébastien Ferré:
On Categorial Grammars as Logical Information Systems. ICFCA 2010: 225-240
2000 – 2009
- 2008
- [c14]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100 - 2007
- [j3]Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. Stud Logica 87(2-3): 225-252 (2007) - [c13]Denis Béchet, Annie Foret:
Fully Lexicalized Pregroup Grammars. WoLLIC 2007: 12-25 - [c12]Annie Foret:
Pregroup Calculus as a Logic Functor. WoLLIC 2007: 147-161 - 2006
- [j2]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
- [c11]Denis Béchet, Annie Foret:
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. LACL 2005: 1-17 - [c10]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Dependency Structure Grammars. LACL 2005: 18-34 - 2004
- [c9]Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. ICGI 2004: 65-76 - 2003
- [c8]Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. ACL 2003: 351-358 - [c7]Denis Béchet, Annie Foret:
Remarques et perspectives sur les langages de prégroupe d'ordre 1/2. TALN (Posters) 2003: 309-314 - [c6]Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. WoLLIC 2003: 60-72 - 2002
- [c5]Annie Foret, Yannick Le Nir:
Rigid Lambek Grammars Are Not Learnable from Strings. COLING 2002 - [c4]Annie Foret, Yannick Le Nir:
On Limit Points for Some Variants of Rigid Lambek Grammars. ICGI 2002: 106-119 - 2001
- [c3]Annie Foret:
On Mixing Deduction and Substitution in Lambek Categorial Grammars. LACL 2001: 158-174 - [c2]Annie Foret:
The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable. FGMOL 2001: 81-93
1990 – 1999
- 1992
- [j1]Annie Foret:
Rewrite Rule Systems for Modal Propositional Logic. J. Log. Program. 12(3&4): 281-298 (1992)
1980 – 1989
- 1988
- [c1]Annie Foret:
Rewrite Rule Systems for Modal Propositional Logic. ALP 1988: 147-156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
