A proof system for dependencies for information relations

Fundamenta Informaticae

Volumn 42, Issue 1, 2000, Pages 1-27

  MacCaull, Wendy ^a  

^a ST FRANCIS XAVIER UNIVERSITY   (Canada)

Author keywords

Dependencies; Information systems; Relational proof system; Relational semantics

Indexed keywords

EID: 0003550238     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-42101     Document Type: Article

References (21)

1. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases, Addison Wesley, 1995.
2. C. Aggarwal and P. Yu, A new framework for itemset generation Proceedings of PODS 98 Principles of Database Systems, 18-24.
3. Ph. Balbiani, Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations, in: E. Orlowska, editor, Incomplete Information: Rough Set Analysis, 1998.
4. Ph. Balbiani and E. Orłowska, A hierarchy of modal logics with relative accessibility relations, Journal of Applied Non-Classical Logics, to appear.
5. W. Buszkowski and E. Orłowska, Indiscernibility-Based Formulation of Dependencies in In-formation Systems, in: E. Orłowska, editor, Incomplete Information: Rough Set Analysis, 1998.
6. S. Gottwald, Many-valued logic, to appear in: U. Hohle, editor, The Mathematics of Fuzzy Sets; A Handbook of Fuzzy Sets Methodology, Kluwer, 1998.
7. A. Jaoua, N. Belkhiter, H. Ounalli, T. Moukam, Databases, in: C. Brink, W. Kahl and G. Schmidt, editors, Relational Methods in Computer Science, Springer Verlag, 1996, pp. 197-210.
8. W. MacCaull, Relational tableaux for tree models, language models and information networks, in: E. Orłowska, editor, Logic at Work. A Memorial Tribute to Helena Rasiowa, Springer Physica Verlag, 1999, pp 354-382.
9. W. MacCaull, Relational semantics and a relational proof theory for full Lambek calculus, Journal of Symbolic Logic, Volume 63 (1998) 623-637.
10. W. MacCaull, A relational approach to association rules and functional dependencies, in: E. Orłowska and A. Szalas, editors, Proceedings of RelMiCS4, Fourth International Seminar on Relational Methods in Computer Science, Warsaw, Poland, 1998, pp 159-164.
11. E. Orłowska, Introduction: What You Always Wanted to Know About Rough Sets, in: E. Orłowska, editor, Incomplete Information: Rough Set Analysis, 1998.
12. E. Orłowska, Relational Foundations of Nonclassical Logics, in: C. Brink, W. Kahl, G. Schmidt, editors, Relational Methods in Computer Science, Springer Verlag, 1996, pp. 90-105.
13. E. Orłowska, Algebraic approach to database constraints, Fundamenta Informaticae, Volume 10 (1987) 57-66.
14. E. SanJuan and L. Iturrioz, Duality and informational representability of some information algebras, preprint, 1997.
15. Y. Sagiv, C. Delobel, D.S. Parker and R. Fagin, An equivalence between relational dependencies and a fragment of propositional logic, Journal of the ACM, Volume 28 (1981) 435-453.
16. D. Simovici and C. Reischer, An algebraic point of view of the data structures of database systems, Discrete Applied Mathematics Volume 24 (1989) 247-260.
17. V. Sofronie-Stokkermans, On the universal theory of varieties of distributive lattices with operators: some decidability and complexity results, in: H. Ganzinger, editor, Automated Deduction - CADE-16, Lecture Notes in Artificial Intelligence, 1632, Springer, 1999, pp. 157-171.
18. J. Ullman, Database and Knowledge-Base Systems, Volume 1, Computer Science Press, Inc, 1988.
19. J. van Benthem, Exploring Logical Dynamics, CLSI Publications, 1996.
20. D. Wijesekera, M. Ganesh, J. Srivastava and A. Nerode, Tableaux for functional dependencies and independencies, in: D. Gilmiche, editor, Automated reasoning with analytic tableaux and related methods, Lecture Notes in Artificial Intelligence 1227, Springer, 1997 (Proceedings of Tableaux 97).
21. R. Wille, Restructuring Lattice Theory, in: I. Rival, editor, Ordered Sets, Reidel, 1982.