REFUTATIONAL THEOREM-PROVING USING TERM-REWRITING SYSTEMS

被引：102

|

作者：

HSIANG, J

机构：

来源：

ARTIFICIAL INTELLIGENCE | 1985年 / 25卷 / 03期

关键词：

D O I：

10.1016/0004-3702(85)90074-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

收藏

页码：255 / 300

页数：46

相关论文

共 50 条

[1] HEURISTIC CRITERIA IN REFUTATIONAL THEOREM-PROVING
ANANTHARAMAN, S
ANDRIANARIVELO, N
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 429 : 184 - 193
[2] A REFUTATIONAL APPROACH TO GEOMETRY THEOREM-PROVING
KAPUR, D
ARTIFICIAL INTELLIGENCE, 1988, 37 (1-3) : 61 - 93
[3] THE TERM REWRITING APPROACH TO AUTOMATED THEOREM-PROVING
HSIANG, J
KIRCHNER, H
LESCANNE, P
RUSINOWITCH, M
JOURNAL OF LOGIC PROGRAMMING, 1992, 14 (1-2): : 71 - 99
[4] 2 RESULTS IN TERM REWRITING THEOREM-PROVING
HSIANG, J
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 202 : 301 - 324
[5] A NEW METHOD FOR ESTABLISHING REFUTATIONAL COMPLETENESS IN THEOREM-PROVING
HSIANG, J
RUSINOWITCH, M
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 141 - 152
[6] Combining Clifford algebraic computing and term-rewriting for geometric theorem proving
Fevre, Stephane
Wang, Dongming
Fundamenta Informaticae, 1999, 39 (1-2): : 85 - 104
[7] PROVING REFUTATIONAL COMPLETENESS OF THEOREM-PROVING STRATEGIES - THE TRANSFINITE SEMANTIC TREE METHOD
HSIANG, J
RUSINOWITCH, M
JOURNAL OF THE ACM, 1991, 38 (03) : 559 - 587
[8] USE OF CONDITIONAL TERM REWRITING-SYSTEMS IN AUTOMATIC THEOREM-PROVING .1.
VOROBYEV, SG
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1989, 27 (01): : 49 - 59
[9] REFUTATIONAL THEOREM-PROVING FOR HIERARCHICAL 1ST-ORDER THEORIES
BACHMAIR, L
GANZINGER, H
WALDMANN, U
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1994, 5 (3-4) : 193 - 212
[10] ORDERINGS FOR TERM-REWRITING SYSTEMS
DERSHOWITZ, N
THEORETICAL COMPUTER SCIENCE, 1982, 17 (03) : 279 - 301

← 1 2 3 4 5 →