Decades of lexical ambiguity research has rigorously studied effects of relative sense frequency on sense disambiguation in biased contexts, while fundamental semantic issues such as distinction of different types of ambiguities, or influences from lexical meanings’ semantic nature (e.g., literal or metaphorical) as well as these meanings’ degrees of conventionalization, have received less atte...

Museum and art-gallery curators have long had specialist collection management systems to facilitate access to works of art that were not available to the general public. The increasing availability of aesthetic images on the World Wide Web, however, especially through museum and gallery web pages, went hand in hand with an increasing sophistication of search paradigms. Retrieval methods have, ...

Do listeners process literal and figurative speech differently? Research testing interpretation times has resulted in mixed findings. Some researchers have found that figurative language is processed more slowly than literal language (e.g. Noveck et.al 2001) whereas others have not (e.g. Glucksberg 2003, Gibbs & Tendahl 2006). This may be due to limitations of standard reaction time methodology...

The distinction between literal and figurative use is well-known embedded in ‘folk linguistics’. According to folk linguistics, uses deviate from ones. But recent work on lexical modulation polysemy shows that meaning deviation ubiquitous, even cases of use. Hence, it has been argued, the literal/figurative no value for theorising about communication. In this paper, we focus metaphor argue here...

Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields an empty clause then the negated assumption is necessary for satisfiability. Whereas FL is common in SAT, it cannot easily be applied to QBF due to universal quantification. We present two approaches for FL to preproc...

Straight-Line Programs (SLP) are widely used compressed representations of words. In this work we study the rational transformations and the literal shuffle of words compressed via SLP, proving that the first preserves the compression rate, while the second does not. As a consequence, we prove a tight bound for the descriptional complexity of 2D texts compressed via SLP. Finally, we observe tha...

We develop a formal framework intended as a preliminary step for a single knowledge representation system that provides different representation techniques in a unified way. In particular we consider first-order logic extended by techniques for second-order quantifier elimination and non-monotonic reasoning. Background of the work is literal projection, a generalization of second-order quantifi...

Given an over-constrained system, a Maximal Satisfiable Subset (MSS) denotes a maximal set of constraints that are consistent. A Minimal Correction Subset (MCS, or co-MSS) is the complement of an MSS. MSSes/MCSes find a growing range of practical applications, including optimization, configuration and diagnosis. A number of MCS extraction algorithms have been proposed in recent years, enabling ...

The computation of literal projection generalizes predicate quantifier elimination by permitting, so to speak, quantifying upon an arbitrary sets of ground literals, instead of just (all ground literals with) a given predicate symbol. Literal projection allows, for example, to express predicate quantification upon a predicate just in positive or negative polarity. Occurrences of the predicate i...