SciELO - Scientific Electronic Library Online

vol.22 issue1Inferences for Enrichment of Collocation Databases by Means of Semantic RelationsAn Overview of Ontology Learning Tasks author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Computación y Sistemas

Print version ISSN 1405-5546


LAVALLE, Jesús et al. Automatic Theorem Proving for Natural Logic: A Case Study on Textual Entailment. Comp. y Sist. [online]. 2018, vol.22, n.1, pp.119-135. ISSN 1405-5546.

Recognizing Textual Entailment (RTE) is a Natural Language Processing task. It is very important in tasks as Semantic Search and Text Summarization. There are many approaches to RTE, for example, methods based on machine learning, linear programming, probabilistic calculus, optimization, and logic. Unfortunately, no one of them can explain why the entailment is carried on. We can make reasonings, with Natural Logic, from the syntactic part of a natural language expression, and very little semantic information. This paper presents an Automatic Theorem Prover for Natural Logic that allows to know precisely the relationships needed in order to reach the entailment in a class of natural language expressions.

Keywords : Textual entailment; automatic theorem proving; natural logic.

        · text in English     · English ( pdf )