Natural Solution to FraCaS Entailment Problems

Lasha Abzianidze

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

16 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 -
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
Period11/08/1612/08/16
Internet address

Fingerprint

Semantics
Theorem proving
Schematic diagrams
Transparency

Keywords

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

Cite this

Abzianidze, L. (2016). Natural Solution to FraCaS Entailment Problems. In Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics: (*SEM 2016) (pp. 64-74)
Abzianidze, Lasha. / Natural Solution to FraCaS Entailment Problems. Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics: (*SEM 2016). 2016. pp. 64-74
@inproceedings{844598aa442145d5a5c99d90dddb6c19,
title = "Natural Solution to FraCaS Entailment Problems",
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.",
keywords = "natural logic, fracas, textual entailment, semantic tableau, reasoning",
author = "Lasha Abzianidze",
year = "2016",
language = "English",
isbn = "9781510827578",
pages = "64--74",
booktitle = "Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics",

}

Abzianidze, L 2016, Natural Solution to FraCaS Entailment Problems. in Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics: (*SEM 2016). pp. 64-74, the Fifth Joint Conference on Lexical and Computational Semantics, 11/08/16.

Natural Solution to FraCaS Entailment Problems. / Abzianidze, Lasha.

Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics: (*SEM 2016). 2016. p. 64-74.

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

TY - GEN

T1 - Natural Solution to FraCaS Entailment Problems

AU - Abzianidze, Lasha

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - natural logic

KW - fracas

KW - textual entailment

KW - semantic tableau

KW - reasoning

M3 - Conference contribution

SN - 9781510827578

SP - 64

EP - 74

BT - Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics

ER -

Abzianidze L. Natural Solution to FraCaS Entailment Problems. In Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics: (*SEM 2016). 2016. p. 64-74