THE IMPLICATION PROBLEM FOR FUNCTIONAL AND INCLUSION DEPENDENCIES IS UNDECIDABLE

被引:67
作者
CHANDRA, AK [1 ]
VARDI, MY [1 ]
机构
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
关键词
D O I
10.1137/0214049
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
16
引用
收藏
页码:671 / 677
页数:7
相关论文
共 16 条
[1]  
Armstrong W., 1974, INFORM PROCESSING, P580
[2]   FORMAL SYSTEMS FOR TUPLE AND EQUALITY GENERATING DEPENDENCIES [J].
BEERI, C ;
VARDI, MY .
SIAM JOURNAL ON COMPUTING, 1984, 13 (01) :76-98
[3]  
Beeri C., 1979, ACM Transactions on Database Systems, V4, P30, DOI 10.1145/320064.320066
[4]  
Bernstein P. A., 1976, ACM Transactions on Database Systems, V1, P277, DOI 10.1145/320493.320489
[5]   INCLUSION DEPENDENCIES AND THEIR INTERACTION WITH FUNCTIONAL-DEPENDENCIES [J].
CASANOVA, MA ;
FAGIN, R ;
PAPADIMITRIOU, CH .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (01) :29-59
[6]  
Codd E. F., 1972, DATA BASE SYSTEMS, P33
[7]   ARMSTRONG DATABASES FOR FUNCTIONAL AND INCLUSION DEPENDENCIES [J].
FAGIN, R ;
VARDI, MY .
INFORMATION PROCESSING LETTERS, 1983, 16 (01) :13-19
[8]  
FAGIN R, 1983, ACM T DATABASE SYSTE, V6, P387
[9]   THE WORD PROBLEM FOR CANCELLATION SEMIGROUPS WITH ZERO [J].
GUREVICH, Y ;
LEWIS, HR .
JOURNAL OF SYMBOLIC LOGIC, 1984, 49 (01) :184-191
[10]  
Gurevich Y., 1966, ALGEBRA LOGIKA+, V5, P25