ON COMPILING QUERIES IN RECURSIVE 1ST-ORDER DATABASES

被引：83

作者：

HENSCHEN, LJ ^{[1
]}

NAQVI, SA ^{[1
]}

机构：

[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1145/2422.2423

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：47 / 85

页数：39

共 13 条

[1] Aho A.V., 1972, THEORY PARSING TRANS, V1
[2] PRODUCT-REPRESENTATION - CLAUSE REPRESENTATION FOR PARALLEL SEARCH
FISHMAN, DH
MINKER, J
[J]. ARTIFICIAL INTELLIGENCE, 1975, 6 (02) : 103 - 127
[3] MCKAY D, 1981, 7TH P INT JOINT C AR
[4] MINKER J, 1981, TR1119 U MAR TECH RE
[5] NILSSON J, 1979, WORKSHOP FORMAL BASI
[6] Reiter R., 1978, Logic and data bases, P55
[7] EQUALITY AND DOMAIN CLOSURE IN 1ST-ORDER DATABASES
REITER, R
[J]. JOURNAL OF THE ACM, 1980, 27 (02) : 235 - 249
[8] REITER R, 1978, 2ND P NAT C CAN SOC, P90
[9] A MACHINE-ORIENTED LOGIC BASED ON RESOLUTION PRINCIPLE
ROBINSON, JA
[J]. JOURNAL OF THE ACM, 1965, 12 (01) : 23 - &
[10] SHAPIRO SC, 1980, P 1 ANN NAT C ART IN, P151