On the Membership Problem for Non-Linear Abstract Categorial Grammars
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
SALVATI, Sylvain
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
< Reduce
Linguistic signs, grammar and meaning: computational logic for natural language [SIGNES]
Language
en
Article de revue
This item was published in
Journal of Logic, Language and Information. 2010-04, vol. 19, n° 2, p. 163-183
Springer Verlag
English Abstract
In this paper we show that the membership problem for second order non- linear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation ...Read more >
In this paper we show that the membership problem for second order non- linear Abstract Categorial Grammars is decidable. A consequence of that result is that Montague-like semantics yield to a decidable text generation problem. Furthermore the proof we propose is based on a new tool, Higher Order Intersection Signatures, which grasps statically dynamic properties of λ-terms and presents an interest in its own.Read less <
English Keywords
lambda-calculus
Montague semantics
text generation
intersection types
Origin
Hal imported