Annie Foret - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2023

Extracting ODRL Digital Right Representations from License Texts using AMRMalo Revel, Aurélien Lamercerie, Annie Foret, Zoltán Miklós 0001. icail 2023: 151-157 [doi]

2016

Categorial Dependency Grammars with Iterated SequencesDenis Béchet, Annie Foret. lacl 2016: 34-51 [doi]

Simple K-star Categorial Dependency Grammars and their InferenceDenis Béchet, Annie Foret. icgi 2017: 3-14 [doi]

Exploration des Données du Défi EGC 2016 à l'aide d'un Système d'Information LogiquePeggy Cellier, Sébastien Ferré, Annie Foret, Olivier Ridoux. f-egc 2016: 443-448 [doi]

2015

A Logical Information System Proposal for Browsing Terminological ResourcesAnnie Foret. tia 2015: 51-59 [doi]

TermLis : un contexte d'information logique pour des ressources terminologiquesAnnie Foret. taln 2015: 8-9 [doi]

2014

On Associative Lambek Calculus Extended with Basic Proper AxiomsAnnie Foret. BIRTHDAY 2014: 172-187 [doi]

On Harmonic CCG and Pregroup GrammarsAnnie Foret. lacl 2014: 83-95 [doi]

2012

Categorial grammars with iterated types form a strict hierarchy of k-valued languagesDenis Béchet, Alexandre Ja. Dikovsky, Annie Foret. TCS, 450:22-30, 2012. [doi]

2011

On Dispersed and Choice Iteration in Incrementally Learnable Dependency TypesDenis Béchet, Alexander Ja. Dikovsky, Annie Foret. lacl 2011: 80-95 [doi]

Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued LanguagesDenis Béchet, Alexandre Ja. Dikovsky, Annie Foret. wia 2011: 42-52 [doi]

2010

Two Models of Learning Iterated DependenciesDenis Béchet, Alexander Ja. Dikovsky, Annie Foret. fg 2012: 17-32 [doi]

A modular and parameterized presentation of pregroup calculusAnnie Foret. iandc, 208(5):510-520, 2010. [doi]

On Categorial Grammars as Logical Information SystemsAnnie Foret, Sébastien Ferré. icfca 2010: 225-240 [doi]

2008

Optional and Iterated Types for Pregroup GrammarsDenis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel. LATA 2008: 88-100 [doi]

2007

Fully Lexicalized Pregroup GrammarsDenis Béchet, Annie Foret. wollic 2007: 12-25 [doi]

Learnability of Pregroup GrammarsDenis Béchet, Annie Foret, Isabelle Tellier. sLogica, 87(2-3):225-252, 2007. [doi]

Pregroup Calculus as a Logic FunctorAnnie Foret. wollic 2007: 147-161 [doi]

2006

::::k::::-Valued non-associative Lambek grammars are learnable from generalized functor-argument structuresDenis Béchet, Annie Foret. TCS, 355(2):139-152, 2006. [doi]

2005

Dependency Structure GrammarsDenis Béchet, Alexander Ja. Dikovsky, Annie Foret. lacl 2005: 18-34 [doi]

k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of LanguagesDenis Béchet, Annie Foret. lacl 2005: 1-17 [doi]

2004

Learnability of Pregroup GrammarsDenis Béchet, Annie Foret, Isabelle Tellier. icgi 2004: 65-76 [doi]

2003

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument StructuresDenis Béchet, Annie Foret. ENTCS, 84:60-72, 2003. [doi]

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from StringsDenis Béchet, Annie Foret. acl 2003: 351-358 [doi]

Remarques et perspectives sur les langages de prégroupe d'ordre 1/2Denis Béchet, Annie Foret. taln 2003: 309-314 [doi]

2002

Rigid Lambek Grammars Are Not Learnable from StringsAnnie Foret, Yannick Le Nir. COLING 2002: [doi]

On Limit Points for Some Variants of Rigid Lambek GrammarsAnnie Foret, Yannick Le Nir. icgi 2002: 106-119 [doi]

2001

On Mixing Deduction and Substitution in Lambek Categorial GrammarsAnnie Foret. lacl 2001: 158-174 [doi]

The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidableAnnie Foret. ENTCS, 53:81-93, 2001. [doi]

1992

Rewrite Rule Systems for Modal Propositional LogicAnnie Foret. jlp, 12(3&4):281-298, 1992.

1988

Rewrite Rule Systems for Modal Propositional LogicAnnie Foret. icalp 1988: 147-156

Sign in or sign up to see more results.

runs on WebDSL