We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail ...

In this paper we introduce the pattern literal reification, a modelling technique to address scenarios, in which we need to bless particular literals, usually when applying data properties, in order to use them as subjects and/or full-fledged objects of semantic assertions.

We propose an unsupervised method for distinguishing literal and non-literal usages of idiomatic expressions. Our method determines how well a literal interpretation is linked to the overall cohesive structure of the discourse. If strong links can be found, the expression is classified as literal, otherwise as idiomatic. We show that this method can help to tell apart literal and non-literal us...

Based on psychological studies which show that metaphors and other non-literal constructions are comprehended in the same amount of time as comparable literal constructions, some researchers have concluded that literal meaning is not computed during comprehension of non-literal constructions. In this paper, we suggest that the empirical evidence does not rule out the possibility that literal me...