Tuple Relational Calculus for Paraconsistent Databases
A paraconsistent database is one in which information may be incomplete and/or inconsistent. A data model that does not attempt to eliminate such incompleteness or inconsistency, but rather is capable of functioning in their presence, has recently been developed. In this paper, we present a 4-valued tuple relational calculus for posing queries to paraconsistent databases based on that model. The syntax of our calculus is similar to that of the regular 2-valued relational calculus on ordinary relational databases, but our new 4-valued semantics makes it a useful querying tool for applications containing incomplete and inconsistent information. Moreover, as the model (out of necessity) freely permits infinite relations, the issue of safety of calculus expressions, that is so important in 2-valued systems, is not relevant any more.
KeywordsRelational data model Incomplete and inconsistent information Tuple relational calculus
Unable to display preview. Download preview PDF.
- 4.R. Bagai. A query construct for paraconsistent databases. In Proceedings of the 7th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, France, pp. 428–434, 1998.Google Scholar
- 5.N. D. Belnap. A useful four-valued logic. In G. Eppstein and J. M. Dunn, editors, Modern Uses of Many-valued Logic, pages 8–37. Reidel, Dordrecht, 1977.Google Scholar
- 9.N. Tran and R. Bagai. Infinite Relations in Paraconsistent Databases. Lecture Notes in Computer Science, 1691:275–287, 1999.Google Scholar
- 10.N. Tran and R. Bagai. Efficient Representation and Algebraic Manipulation of Infinite Relations in Paraconsistent Databases. Submitted, Information Systems.Google Scholar