FLATTERMS, DISCRIMINATION NETS, AND FAST TERM REWRITING

被引：34

作者：

CHRISTIAN, J ^{[1
]}

机构：

[1] KYOTO UNIV,KYOTO 606,JAPAN

来源：

JOURNAL OF AUTOMATED REASONING | 1993年 / 10卷 / 01期

关键词：

KNUTH-BENDIX COMPLETION; INDEXING; DISCRIMINATION NETS; 1ST-ORDER TERMS; TERM REWRITING;

D O I：

10.1007/BF00881866

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We describe a new representation for first-order terms which is amenable to simple and fast traversal and matching operations. In addition, we describe some efficient discrimination net indexing algorithms which use the new term representation. We have implemented these ideas in a term rewriting system called HIPER, and have obtained substantial speedups.

引用

页码：95 / 113

页数：19

共 20 条

[1]

BOYER B, 1986, AI19486P MCC MICR CO

[2]

CHRISTIAN J, 1989, P C REWRITING TECHNI

[3]

CHRISTIAN J, 1989, MCC ACTAI30389 TECHN

[4]

GESER A, 1987, 1ST P INT WORKSH CON, P84

[5] TERNARY BOOLEAN ALGEBRA [J].

GRAU, AA .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1947, 53 (06) :567-572

[6]

GREENBAUM S, 1986, THESIS U URBANA CHAM

[7]

HEUILLARD T, 1987, 1ST P INT WORKSH CON, P111

[8]

HSIANG J, 1986, SUNY8629 DEP COMP SC

[9]

JOUANNAUD JP, 1986, SIAM J COMPUTING NOV

[10]

KAPLAN S, 1987, P C REWRITING TECHNI, P25

← 1 2 →