Paraconsistency and Word Puzzles

by   Tiantian Gao, et al.

Word puzzles and the problem of their representations in logic languages have received considerable attention in the last decade (Ponnuru et al. 2004; Shapiro 2011; Baral and Dzifcak 2012; Schwitter 2013). Of special interest is the problem of generating such representations directly from natural language (NL) or controlled natural language (CNL). An interesting variation of this problem, and to the best of our knowledge, scarcely explored variation in this context, is when the input information is inconsistent. In such situations, the existing encodings of word puzzles produce inconsistent representations and break down. In this paper, we bring the well-known type of paraconsistent logics, called Annotated Predicate Calculus (APC) (Kifer and Lozinskii 1992), to bear on the problem. We introduce a new kind of non-monotonic semantics for APC, called consistency preferred stable models and argue that it makes APC into a suitable platform for dealing with inconsistency in word puzzles and, more generally, in NL sentences. We also devise a number of general principles to help the user choose among the different representations of NL sentences, which might seem equivalent but, in fact, behave differently when inconsistent information is taken into account. These principles can be incorporated into existing CNL translators, such as Attempto Controlled English (ACE) (Fuchs et al. 2008) and PENG Light (White and Schwitter 2009). Finally, we show that APC with the consistency preferred stable model semantics can be equivalently embedded in ASP with preferences over stable models, and we use this embedding to implement this version of APC in Clingo (Gebser et al. 2011) and its Asprin add-on (Brewka et al. 2015).


page 1

page 2

page 3

page 4


Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT

Approximation fixpoint theory (AFT) provides an algebraic framework for ...

Schrödinger's Bat: Diffusion Models Sometimes Generate Polysemous Words in Superposition

Recent work has shown that despite their impressive capabilities, text-t...

A Deterministic Algorithm for Bridging Anaphora Resolution

Previous work on bridging anaphora resolution (Poesio et al., 2004; Hou ...

Stable ResNet

Deep ResNet architectures have achieved state of the art performance on ...

Inducing Affective Lexical Semantics in Historical Language

The emotional connotation attached to words undergoes language change. I...

Quantifying Learning Guarantees for Convex but Inconsistent Surrogates

We study consistency properties of machine learning methods based on min...

Please sign up or login with your details

Forgot password? Click here to reset