Abstract
A calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style.
This work was performed within the framework of the COST Action 271. Both authors were supported by a NATO PST Collaborative Linkages Grant.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Buszkowski, W., Orłowska, E.: Indiscernibility-based formalization of dependencies in information systems. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 293–315. Physica Verlag, Heidelberg (1997)
Chandra, A.K., Harel, D.: Computable Queries for Relational Data Bases. J. of Computer and System Sciences 21, 156–178 (1980)
Codd, E.: A relational model for large shared data banks. Communications of the ACM 16, 377–387 (1970)
Cosmadakis, S.: Database theory and cylindric lattices in: A.K. Chondra, editor,Proceedings of the 28th Annual Symposium on Foundations of Computer Science,IEEE Computer Science Press (1987) 411-420.
Demri, S., Orłowska, E.: Incomplete Information: Structure, Inference, Complexity. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)
Düntsch, I., Mikulas, S.: Cylindric structures and dependencies in relational databases. J. of Theoretical Computer Science 269, 451–468 (2001)
Imielinski, T., Lipski, W.: The relational model of data and cylindric algebras. J. of Computer and System Sciences 28, 80–102 (1984)
Lipski, W.: On semantic issues connected with incomplete information databases. ACM Transactions on Database Sytems 4, 262–296 (1979)
MacCaull, W.: Proof theory for generalized dependencies for information relations. Fundamenta Informaticae 42, 1–27 (2000)
MacCaull, W., Orłowska, E.: A logic of typed relations and its applications to relational database theory (preprint)
MacCaull, W., Orłowska, E.: Correspondence results for relational proof systems with application to the Lambek calculus. Studia Logica 71, 389–414 (2002)
Orłowska, E.: Algebraic approach to database constraints. Fundamenta Informaticae 10, 57–66 (1987)
Orłowska, E.: Relational Formalization of Nonclassical Logics. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 90–105. Springer, Heidelberg (1996)
Orłowska, E.: Introduction: What You Always Wanted to Know About Rough Sets. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 1–20. Physica Verlag, Heidelberg (1997)
Pawlak, Z.: Rough Sets. Kluwer, Dordrecht (1991)
Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Science Publishers, Warsaw (1963)
Simovici, D.A., Tenney, R.L.: Relational Database Systems. Academic Press, London (1995)
Ullman, J.: Database and Knowledge-Base Systems, vol. 1. Computer Science Press (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacCaull, W., Orłowska, E. (2004). A Calculus of Typed Relations. In: Berghammer, R., Möller, B., Struth, G. (eds) Relational and Kleene-Algebraic Methods in Computer Science. RelMiCS 2003. Lecture Notes in Computer Science, vol 3051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24771-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24771-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22145-6
Online ISBN: 978-3-540-24771-5
eBook Packages: Springer Book Archive