Automatic Theorem Proving for Natural Logic: A Case Study on Textual Entailment

被引：0

作者：

Lavalle, Jesus ^{[1
,2
]}

Montes, Manuel ^{[1
]}

Jimenez, Hector ^{[3
]}

Villasenor, Luis ^{[1
]}

Beltran, Beatriz ^{[2
]}

机构：

[1] Inst Nacl Astrofis Opt & Electr, Coordinac Ciencias Computac, Santa Maria Tonanzintla, Mexico

[2] Benemerita Univ Autonoma Puebla, Fac Ciencias Comp, Puebla, Mexico

[3] Univ Autonoma Metropolitana, Unidad Cuajimalpa, Div Ciencias Comunicac & Diseno, Dept Tecnol Informac, Ciudad De Mexico, Mexico

来源：

COMPUTACION Y SISTEMAS | 2018年 / 22卷 / 01期

关键词：

Textual entailment; automatic theorem proving; natural logic;

D O I：

10.13053/CyS-22-1-2778

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：119 / 135

页数：17

共 50 条

[31] AUTOMATIC THEOREM-PROVING .1.
VORONKOV, AA
DEGTYAREV, AI
CYBERNETICS, 1986, 22 (03): : 290 - 297
[32] AUTOMATIC THEOREM PROVING IN SET-THEORY
PASTRE, D
ARTIFICIAL INTELLIGENCE, 1978, 10 (01) : 1 - 27
[33] RENAMABLE PARAMODULATION FOR AUTOMATIC THEOREM PROVING WITH EQUALITY
CHANG, CL
ARTIFICIAL INTELLIGENCE, 1970, 1 (04) : 247 - 256
[34] AUTOMATIC THEOREM-PROVING IN THE ISDV SYSTEM
BEIERLE, C
OLTHOFF, W
VOSS, A
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 670 - 671
[35] Cancellation Patterns in Automatic Geometric Theorem Proving
Apel, Susanne
Richter-Gebert, Juergen
AUTOMATED DEDUCTION IN GEOMETRY, 2011, 6877 : 1 - 33
[36] SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING
BLEDSOE, WW
ARTIFICIAL INTELLIGENCE, 1971, 2 (01) : 55 - 77
[37] AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
Goc, Daniel
Henshall, Dane
Shallit, Jeffrey
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (06) : 781 - 798
[38] Building a Textual Entailment Suite for the Evaluation of Automatic Content Scoring Technologies
Sukkarieh, Jana Z.
Bolge, Eleanor
LREC 2010 - SEVENTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2010, : 3149 - 3156
[39] Entailment, assertion, and textual coherence: the case of almost and barely
Amaral, Patricia
LINGUISTICS, 2010, 48 (03) : 525 - 545
[40] Theorem proving for classical logic with partial functions by reduction to Kleene logic
de Nivelle, Hans
JOURNAL OF LOGIC AND COMPUTATION, 2017, 27 (02) : 509 - 548

← 1 2 3 4 5 →