TYPE DATA-BASES WITH INCOMPLETE INFORMATION

被引:4
作者
LENZERINI, M
机构
[1] Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, I-00185 Roma
关键词
D O I
10.1016/0020-0255(91)90058-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The type data base is the part of the data base in which all the information about classes, membership relationships between objects and classes and interdependencies among classes are collected. We study specific type data bases, which allow for representing different kinds of incomplete information, such as existential and disjunctive assertions. In particular, we address the problems of consistency checking and query answering, proposing efficient solutions for both of them. Our analysis is carried out in the context of the logical approach to data bases and knowledge representation, which provides a suitable formal basis for the treatment of incomplete information. © 1991.
引用
收藏
页码:61 / 87
页数:27
相关论文
共 21 条
[1]  
[Anonymous], SYMBOLIC LOGIC MECHA
[2]  
ATZENI P, 1987, LECTURE NOTES COMPUT, V243
[3]  
BRACHMAN RJ, 1983, COMPUTER, V16, P30, DOI 10.1109/MC.1983.1654194
[4]  
BRACHMAN RJ, 1985, P INT JOINT C ARTIFI
[5]  
BRODIE ML, 1984, CONCEPTUAL MODELLING
[6]  
BUNEMAN P, 1986, P ACM SIGMOD 86 INT
[7]  
FAGIN R, 1983, 2ND P ACM S PRINC DA, P352
[8]  
ISRAEL DJ, 1984, CONCEPTUAL MODELING
[9]  
KUPER GM, 1984, 3RD P ACM SIGACT SIG, P221
[10]  
LENZERINI M, 1987, P WORKSHOP DATABASE