This paper explores proof-theoretic aspects of hybrid type-logical grammars, a logic combining Lambek grammars with lambda grammars. We prove some basic properties the calculus, such as normalisation and subformula property also present both sequent proof net calculus for In addition to clarifying logical foundations current study opens way variants extensions original system, including but not...

The German question answering (QA) system IRSAW (formerly: InSicht) participated in QA@CLEF for the fifth time. IRSAW was introduced in 2007, by integrating the deep answer producer InSicht, several shallow answer producers, and a logical validator. InSicht realizes a deep QA approach: it transforms documents to semantic representations using a parser, draws inferences on semantic representatio...

The German question answering (QA) system IRSAW (formerly: InSicht) participated in QA@CLEF for the fifth time. IRSAW was introduced in 2007 by integrating the deep answer producer InSicht, several shallow answer producers, and a logical validator. InSicht builds on a deep QA approach: it transforms documents to semantic representations using a parser, draws inferences on semantic representatio...

In the history of sciences, some apparently independent questions often have received the same answer. For example, the questions “What does make apples fall off trees?”, “What does make planets revolve around the Sun?”, “What does make matter hold together in a star?” all have received the same answer: “gravity”. When this happens, we can say that the concepts used in this answer structure a f...

Visual question answering (VQA) systems are emerging from a desire to empower users to ask any natural language question about visual content and receive a valid answer in response. However, close examination of the VQA problem reveals an unavoidable, entangled problem that multiple humans may or may not always agree on a single answer to a visual question. We train a model to automatically pre...

The efficiency of Distributed Constraints satisfaction algorithms must be measured by concurrent performance measures. In Previous studies we have proposed the count of non concurrent logical steps as an asynchronous measure. This measure is independent of the specific implementation and is not affected by the level of concurrency of the performing algorithm. The method of counting non-concurre...

Despite tremendous progress in the field of Visual Question Answering, models today still tend to be inconsistent and brittle. Thus, we propose a model-independent cyclic framework which increases consistency robustness any VQA architecture. We train our answer original question, generate an implication based on then learn generated correctly. As part framework, novel generator generates implie...

Until not too many years ago, all logics except classical logic (and, perhaps, intuitionis-tic logic too) were considered to be things esoteric. Today this state of aaairs seems to have completely been changed. There is a growing interest in many types of nonclassical logics: modal and temporal logics, substructural logics, paraconsistent logics, non-monotonic logics { the list is long. The div...