DISJUNCTIVE DEDUCTIVE DATABASES

被引：0
作者：
FERNANDEZ, JA [1 ]
MINKER, J [1 ]
机构：
[1] UNIV MARYLAND, INST ADV COMP STUDIES, College Pk, MD 20742 USA
来源：
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE | 1992年 / 624卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Background material is presented on deductive and normal deductive databases. A historical review is presented of work in disjunctive deductive databases, starting from 1982. The semantics of alternative classes of disjunctive databases is reviewed with their model and fixpoint characterizations. Algorithms are developed to compute answers to queries in the alternative theories using the concept of a model tree. Open problems in this area are discussed.
引用
收藏
页码：332 / 356
页数：25
相关论文
共 30 条
[1]   CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMING [J].
APT, KR ;
VANEMDEN, MH .
JOURNAL OF THE ACM, 1982, 29 (03) :841-862
[2]  
Apt Krzysztof R, 1988, FDN DEDUCTIVE DATABA, P89, DOI [10.1016/B978-0-934613-40-8.50006-3, DOI 10.1016/B978-0-934613-40-8.50006-3]
[3]  
BARAL C, 1989, UNPUB GENERALIZED WE
[4]  
BARAL C, 1990, 10TH P INT C AUT DED
[5]  
BARAL C, 1991, 6TH P INT S METH INT
[6]  
BARAL C, 1989, IN PRESS J ANN MATH
[7]  
BISKUP J, 1981, F CODDS RELATIONAL M
[8]  
BORGIDA A, 1989, 1ST P INT C PRINC KN, P33
[9]   SATURATION, NONMONOTONIC REASONING AND THE CLOSED-WORLD ASSUMPTION [J].
BOSSU, G ;
SIEGEL, P .
ARTIFICIAL INTELLIGENCE, 1985, 25 (01) :13-63
[10]  
CHAN E, 1989, POSSIBLE WORLD SEMAN
123