Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bagai and R. Sunderraman. A paraconsistent relational data model. International Journal of Computer Mathematics, 55(1):39–55, 1995.
R. Bagai and R. Sunderraman. Bottom-up computation of the Fitting model for general deductive databases. Journal of Intelligent Information Systems, 6(1):59–75, 1996.
R. Bagai and R. Sunderraman. Computing the well-founded model of deductive databases. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 4(2):157–175, 1996.
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.
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.
C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208–220, 1991.
N. C. A. da Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic, 15:621–630, 1977.
V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2):291–331, 1994.
N. Tran and R. Bagai. Infinite Relations in Paraconsistent Databases. Lecture Notes in Computer Science, 1691:275–287, 1999.
N. Tran and R. Bagai. Efficient Representation and Algebraic Manipulation of Infinite Relations in Paraconsistent Databases. Submitted, Information Systems.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagai, R. (2000). Tuple Relational Calculus for Paraconsistent Databases. In: Monard, M.C., Sichman, J.S. (eds) Advances in Artificial Intelligence. IBERAMIA SBIA 2000 2000. Lecture Notes in Computer Science(), vol 1952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44399-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-44399-1_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41276-2
Online ISBN: 978-3-540-44399-5
eBook Packages: Springer Book Archive