In this paper we study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity and its connection with Strong Meaning Hypothesis.
Strong meaning hypothesis from a computational perspective / Szymanik, J.. - (2007), pp. 211-216. ( 16th Amsterdam Colloquium 2007 Amsterdam 2007).
Strong meaning hypothesis from a computational perspective
Szymanik, J.
2007-01-01
Abstract
In this paper we study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity and its connection with Strong Meaning Hypothesis.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
