Journal of Logic and Computation Advance Access originally published online on August 30, 2006
Journal of Logic and Computation 2006 16(6):789-815; doi:10.1093/logcom/exl010
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
A Logic of Type Relations and its Applications to Relational Databases
Department of Mathematics, Statistics and Computer Science, St.Francis Xavier University PO Box 5000, Antigonish, NS, B2G 2W5, Canada.
National Institute of Telecommunications Szachowa 1, 04-894, Warsaw, Poland. Email: orlowska{at}itl.waw.pl
Email: wmaccaul{at}stfx.ca
| 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.
Keywords: Relational proof systems; typed relations; relational database; non-deterministic databases; information relations; rough set theory
owska