REFUTATIONAL THEOREM-PROVING USING TERM-REWRITING SYSTEMS

被引：103

作者：

HSIANG, J

机构：

来源：

关键词：

D O I：

10.1016/0004-3702(85)90074-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：255 / 300

页数：46

共 48 条

[1]

[Anonymous], SYMBOLIC LOGIC MECHA

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] NON-RESOLUTION THEOREM PROVING [J].

BLEDSOE, WW .

[4]

BRAND D, 1975, SIAM J COMPUT, V4

[5]

DAVIS M, 1980, P NATIONAL C ARTIFIC

[6] ORDERINGS FOR TERM-REWRITING SYSTEMS [J].

DERSHOWITZ, N .

[7]

DERSHOWITZ N, 1983, COMMUNICATION

[8]

DERSHOWITZ N, 1983, P SEMINAIRE INFORMAT

[9]

FAGES F, 1984, 7TH P C AUT DED NAPP

[10]

GOGUEN JA, 1980, 5TH C AUT DED ARCS, P356