Top-down query processing in indefinite stratified databases

被引：13

作者：

Johnson, CA ^{[1
]}

机构：

[1] Univ Keele, Dept Comp Sci, Keele ST5 5BG, Staffs, England

来源：

DATA & KNOWLEDGE ENGINEERING | 1998年 / 26卷 / 01期

关键词：

deductive databases; indefinite stratified databases; top-down query processing; perfect models; cyclic trees; deduction trees;

D O I：

10.1016/S0169-023X(97)00026-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A top-down query processing method for indefinite stratified databases is presented. Our method is applicable to first-order (function free) databases in which negative atoms are allowed within the rule bodies, and databases are interpreted using the perfect model semantics. Our method is correct and complete, and employs a construction involving cyclic and deduction trees. Mild constraints are placed on the database in order to guarantee the termination of such constructions.

引用

页码：1 / 36

页数：36

共 57 条

[1] [Anonymous], 1987, AUTOMATED THEOREM PR
[2] [Anonymous], J LOGIC PROGRAM
[3] [Anonymous], 1992, FDN DISJUNCTIVE LOGI
[4] Apt K.R., 1988, THEORY DECLARATIVE K, P89
[5] Characterizations of the disjunctive stable semantics by partial evaluation
Brass, S
Dix, J
[J]. JOURNAL OF LOGIC PROGRAMMING, 1997, 32 (03): : 207 - 228
[6] BRASS S, P 12 NT C LOG PROGR
[7] BRASS S, 1996, SPRINGER LECT NOTES, V1126, P268
[8] BRASS S, COMP EFFICIENT COMPU
[9] BRASS S, 1994, INNOVATIONEN BEI REC, P83
[10] BRASS S, 1995, LECT NOTES ARTIF INT, V927, P127

← 1 2 3 4 5 6 →