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 language | English |
|---|---|
| Title of host publication | Proceedings of the Fifth Joint Conference on Lexical and Computational Semantics |
| Subtitle of host publication | (*SEM 2016) |
| Pages | 64-74 |
| Number of pages | 11 |
| Publication status | Published - 2016 |
| Event | the Fifth Joint Conference on Lexical and Computational Semantics - Berlin, Germany Duration: 11 Aug 2016 → 12 Aug 2016 https://sites.google.com/site/starsem2016/home |
Conference
| Conference | the Fifth Joint Conference on Lexical and Computational Semantics |
|---|---|
| Abbreviated title | *SEM |
| Country/Territory | Germany |
| City | Berlin |
| Period | 11/08/16 → 12/08/16 |
| Internet address |
Keywords
- natural logic
- fracas
- textual entailment
- semantic tableau
- reasoning