THEORY AND ALGORITHMS FOR DISJUNCTIVE DEDUCTIVE DATABASES

被引：0
作者：
FERNANDEZ, JA
MINKER, J
机构：
来源：
PROGRAMMING AND COMPUTER SOFTWARE | 1993年 / 19卷 / 03期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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 presented 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.
引用
收藏
页码：85 / 111
页数：27
相关论文
共 70 条
  • [1] CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMING
    APT, KR
    VANEMDEN, MH
    [J]. 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, 10TH P INT C AUT DED, P102
  • [4] BARAL C, 1991, 6TH P INT S METH INT
  • [5] BARAL C, 1990, 5TH P INT S METH INT, P456
  • [6] BARAL C, 1989, GENERALIZED WELL FOU
  • [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
    BOSSU, G
    SIEGEL, P
    [J]. ARTIFICIAL INTELLIGENCE, 1985, 25 (01) : 13 - 63
  • [10] CHAN E, 1989, POSSIBLE WORLD SEMAN
1234567