|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
ARMSTRONG, W.W Dependency structures of database relationships. Prec. IFIP 74. North Holland, Amsterdam, 1974, pp. 580-583.
|
| |
3
|
|
| |
4
|
BE~tu, C. Personal communicauon, 1979.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
BgEm, C., AND V AgDL M.Y. A proof procedure for data dependencies. Tech. Pep., Hebrew Univ. of Jerusalem, Jerusalem, Israel, Aug. 1980.
|
| |
9
|
BEERI, C., ^ND Vxgm, M.Y. Formal systems for tuple and equality-generating dependenci~s. Tech. Pep, Hebrew Umv. of Jerusalem, Jerusalem, Israel, Apr. 1981
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
CHANO, C C., AND KEISLER, H.J Model Theory. North Holland, Amsterdam, 1973.
|
| |
14
|
CODD, E.F.Further normah~tion of the database relational model. In Data Base Systems, Courant Computer Science Symposia 6, R Rusdn, Ed., Prentice Hall, Englewood Cliffs, N.J., 1971, pp. 33-64.
|
| |
15
|
CODD, E.F.Relational completeness of data base sub-languages. In Data Base Systems, Courant Computer Science Symposmm, R. Rustm, Ed, Prentice Hall, Englewood Cliffs, N.J. 1971, pp. 65-98
|
| |
16
|
COOPER, E.C.On the expressive power of query languages. Tech. Rep. TR-14-80, Center for Research in Computing Technology, Harvard Univ., Cambndge, Mass., 1980.
|
| |
17
|
DEMOLO~E, R. A syntacucal characterizatmn of a subset of def'trnte and safe formulas. Teeh. Pep., ONERA-CERT, Toulouse, France, Sept. 198i.
|
| |
18
|
DEMOLOMBE, R., AND NICOLAS, J.-M.On the chamctenzaUon of "valid" formulas for database querying. Tech. Rep., ONERA-CERT, Toulouse, France, Sept. 1981.
|
| |
19
|
|
| |
20
|
ENDERTON, H.B. A Mathematical Introduction to Logic. Aeademtc Press, New York, 1972.
|
| |
21
|
|
| |
22
|
FAGIN, R.Funettonal dependenctes in a relational database and propositional logic. IBM ~ Res. DeveL 21, 6 (Nov. 1977), 534-544.
|
| |
23
|
|
| |
24
|
|
| |
25
|
FAOtN, R Armstrong databases. Prec, 7th IBM Syrup. on Mathematical Foundations of Computer Science, Kanagawa, Japan, May 1982.
|
| |
26
|
FAOtN, R., MAmR, D., U~N, J.D., ^ND YAm~AKAK}S, M.Tools for template dependenoes. To appear in SIAM J. Comput.
|
| |
27
|
FAGIN, R., AND VARD}, M.Y. Armstrong databases for functional and inclusion dependencies. Res. Pep. RJ3500, IBM Research Laboratory, San Jose, Cafi~, June 1982.
|
| |
28
|
|
| |
29
|
|
| |
30
|
GR~TZ~R, G. Universal Algebra, 2nd ed. Springer-Vedag, New York, 1979.
|
| |
31
|
|
| |
32
|
Ho~, A.On sentences which are true of direct unions of algebras J. Symbolic Logic 16 (1951), 14--21.
|
| |
33
|
HULL, R.Implicauonal dependency and t'mite specification. Tech. Pep., Univ. of Southern Californta, Los Angeles, Calif., 198 I.
|
| |
34
|
KA~s, P.C. On the computational complexity of eardiaality constraints in relational databases. Inf. Proc. Le#t. 11, 2 (Oct. 1980), 98-101.
|
| |
35
|
K~st~g, H.J.Some appfications of infinitely long formulas. J. Symbolic Logic 30, 3 (Sept. 1965), 339-349.
|
| |
36
|
Kumqs, LL.Answering questions by computer: A logical study. Tech. Rep RM-5428-PR, Rand Corp., Santa Monica, Cahf., Dec. 1967.
|
| |
37
|
|
| |
38
|
MF.tCDt~LZON, A.O., ^~D MAmR, D.Generalized mutual dependencies and the decomposmon of database relations. Pro~. 5th Int. Conf. on Very Large Data Bases, R/o de Janetro, Brazil, 1979, pp. 75-82.
|
| |
39
|
|
| |
40
|
NICOLAS, J.-M.Logic for/reproving integrity checking in relational databases. To appear in Acta
|
| |
41
|
P~.RAOAENS, J. Transitive dependencies in a database scheme. Tech Rep R387, MBLE, Brussels, Belgium, 1979.
|
| |
42
|
PARADAENS J., ANn JANSSZNS, D.Decomposttions of relations: a comprehensive approach. In Advances m Data Base Theory, Vol. 1, H. Gallaire, J. Mmker, and J-M. Nicolas, Eds., Plenum Publishing, New York, 1981.
|
| |
43
|
|
| |
44
|
RISSANEN, J.Theory of relations for databases--A tutorial survey. Proc. 7th Syrup. on Mathematical Foundations of Computer Science, Lecture Notes m Computer Science 64, J. Winkowski, Ed., Springer- Veflag, New YoA, pp. 537-551.
|
| |
45
|
SADRI, F.Personal communication.
|
| |
46
|
|
| |
47
|
|
| |
48
|
|
| |
49
|
sHOI~NFIELD, J.R.Mathematical Logic. Addison-Wesley, Reading, Mass., 1967.
|
| |
50
|
StLVA, A.M., AND M~liLKANOI~F, M.A. A method for helping discover the dependencies of a relation. In Advances In Data Base Theory, Vol. 1, H. Gallair~, J. Minker, and J.-M. Nicolas, Eds., Plenum Publishing, New York, 1981.
|
| |
51
|
SLAGLE, J.R., AND KONIVI~, D. Finding resolution proofs using duplicate goals m AND/OR trees. Inf. Sct. 4 (1971), 313-342.
|
| |
52
|
STATMAN, R. Private commumcation.
|
| |
53
|
TaasYd, A.Contributions to the theory of Models I. Nederl. Akad Wetensch. Proc. Ser. A 57 (1954), 572-588 (Indag. Math., vol 16).
|
| |
54
|
U~, J.D.Principles of Database Syaems. Computer Science Press, Woodland Hills, Calif., 1980.
|
| |
55
|
VXgD}, M.Y.The decision problem for database dependencies. Inf. Proc. Left. 12, 5 (Oct 1981), 251-254.
|
| |
56
|
VAgDI, M.Y. Private commumcauon
|
| |
57
|
|
| |
58
|
YA.~rO.gAKIS, M. Private communication.
|
| |
59
|
YANNAKAKIS, M., AND PAPADIMITRIOU, C.Algebraic dependencies. Proe. 21st IEEE Syrup. on Foundations of Computer Science, Syracuse, N.Y., 1980, pp. 328-332. To appear in J. Comp. Syst. Sci
|
| |
60
|
ZLOOF, M.M. Query-by-example. Proc. 1975 AFIPS NCC, V01. 44 AFIPS Press, Arlington, Va., 1975, pp 431--438.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.4