Natural Solution to FraCaS Entailment Problems

Lasha Abzianidze

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

5 Citations (Scopus)
66 Downloads (Pure)

Abstract

Reasoning over several premises is not a common feature of RTE systems as it usually requires deep semantic analysis. On the other hand, FraCaS is a collection of entailment problems consisting of multiple premises and covering semantically challenging phenomena. We employ the tableau theorem prover for natural language to solve the FraCaS problems in a natural way. The expressiveness of a type theory, the transparency of natural logic and the schematic nature of tableau inference rules make it easy to model challenging semantic phenomena. The efficiency of theorem proving also becomes challenging when reasoning over several premises. After adapting to the dataset, the prover demonstrates state-of-the-art competence over certain sections of FraCaS.
Original languageEnglish
Title of host publicationProceedings of the Fifth Joint Conference on Lexical and Computational Semantics
Subtitle of host publication(*SEM 2016)
Pages64-74
Number of pages11
Publication statusPublished - 2016
Eventthe Fifth Joint Conference on Lexical and Computational Semantics - Berlin, Germany
Duration: 11 Aug 201612 Aug 2016
https://sites.google.com/site/starsem2016/home

Conference

Conferencethe Fifth Joint Conference on Lexical and Computational Semantics
Abbreviated title*SEM
CountryGermany
CityBerlin
Period11/08/1612/08/16
Internet address

Keywords

  • natural logic
  • fracas
  • textual entailment
  • semantic tableau
  • reasoning

Fingerprint Dive into the research topics of 'Natural Solution to FraCaS Entailment Problems'. Together they form a unique fingerprint.

Cite this