Titlebook: Logical Aspects of Computational Linguistics; 6th International Co Sylvain Pogodalla,Jean-Philippe Prost Conference proceedings 2011 Spring

enlist

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588128.jpg

Culpable

The Product-Free Lambek-Grishin Calculus Is NP-Complete,The Lambek-Grishin calculus . is the symmetric extension of the non-associative Lambek calculus .. In this paper we prove that the derivability problem for the product-free fragment of . is NP-complete, thus improving on Bransen (2010) where this is shown for . with product.

無效

Contextual Analysis of Word Meanings in Type-Theoretical Semantics,ings of words may be represented in type-theoretical semantics, the formal semantics based on modern type theories. It is shown, in particular, that the framework of coercive subtyping provides various useful tools in the representation.

不公開

linear

Vasoconstrictor

coddle

雪上輕舟飛過

Using Logic in the Generation of Referring Expressions,ogical languages in the output of the content determination phase (i.e., when the relevant features of the object to be referred are selected). Many different logics can be used for this and we argue that, for a particular application, the actual choice shall constitute a compromise between expressi

無力更進

廣告

Copredication, Quantification and Frames,2,1]). We will suggest that using record types gives us a general account of dot types and also makes a connection between copredication and the use of hypothetical contexts in a record type theoretic analysis of dynamic generalized quantifiers. We propose a view of lexical innovation which draws bo