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 条

[41] PRZYMUSINSKI TC, 1992, P INT C MATH FDN COM, P451
[42] PRZYMUSINSKI TC, 1991, P 2 INT C DED OBJ OR
[43] RAJASEKAR A, 1989, S REPR REAS, P349
[44] RAJASEKAR A, ANN MATH ARTIFICIAL
[45] RAJASEKAR A, S LOG DAT KNOWL REPR
[46] RAJASEKAR A, 1990, ANN MATH ARTIFICIAL, V1, P339
[47] A COMPARISON OF 3 PROLOG EXTENSIONS
REED, DW
LOVELAND, DW
[J]. JOURNAL OF LOGIC PROGRAMMING, 1992, 12 (1-2): : 25 - 50
[48] Ross K. A., 1988, Journal of Automated Reasoning, V4, P397, DOI 10.1007/BF00297247
[49] AN ALTERNATIVE APPROACH TO THE SEMANTICS OF DISJUNCTIVE LOGIC PROGRAMS AND DEDUCTIVE DATABASES
SAKAMA, C
INOUE, K
[J]. JOURNAL OF AUTOMATED REASONING, 1994, 13 (01) : 145 - 172
[50] STICKEL ME, 1986, P 8 INT C AUT DED, P573

← 1 2 3 4 5 6 →