USE OF CONDITIONAL TERM REWRITING-SYSTEMS IN AUTOMATIC THEOREM-PROVING .1.

被引：0

|

作者：

VOROBYEV, SG

机构：

来源：

SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES | 1989年 / 27卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：49 / 59

页数：11

相关论文

共 50 条

[41] CONSTRUCTOR EQUIVALENT TERM REWRITING-SYSTEMS
DURAND, I
SALINIER, B
INFORMATION PROCESSING LETTERS, 1993, 47 (03) : 131 - 137
[42] ALGORITHMIC COMPLEXITY OF TERM REWRITING-SYSTEMS
CHOPPY, C
KAPLAN, S
SORIA, M
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 256 : 256 - 273
[43] INDUCTIVE SYNTHESIS OF TERM REWRITING-SYSTEMS
BARZDINS, G
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 502 : 253 - 285
[44] SEQUENTIALITY IN ORTHOGONAL TERM REWRITING-SYSTEMS
KLOP, JW
MIDDELDORP, A
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 12 (02) : 161 - 195
[45] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
KURIHARA, M
KAJI, I
INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
[46] ON THE DESCRIPTIVE POWER OF TERM REWRITING-SYSTEMS
AVENHAUS, J
JOURNAL OF SYMBOLIC COMPUTATION, 1986, 2 (02) : 109 - 122
[47] ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
Goc, Daniel
Rampersad, Narad
Rigo, Michel
Salimov, Pavel
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (08) : 1097 - 1110
[48] Automated inductive theorem proving using transformations of term rewriting systems
Sato, Koichi
Kikuchi, Kentaro
Aoto, Takahito
Toyama, Yoshihito
Computer Software, 2015, 32 (01): : 179 - 193
[49] M-CALCULUS - A SEQUENT METHOD FOR AUTOMATIC THEOREM-PROVING
MANTSIVODA, AV
CYBERNETICS AND SYSTEMS ANALYSIS, 1993, 29 (01) : 130 - 136
[50] Theorem-proving anonymity of infinite-state systems
Kawabe, Yoshinobu
Mano, Ken
Sakurada, Hideki
Tsukada, Yasuyuki
INFORMATION PROCESSING LETTERS, 2007, 101 (01) : 46 - 51

← 1 2 3 4 5 →