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. © Springer-Verlag 2000.
CITATION STYLE
Bagai, R. (2000). Tuple relational calculus for paraconsistent databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1952 LNAI, pp. 409–416). Springer Verlag. https://doi.org/10.1007/3-540-44399-1_42
Mendeley helps you to discover research relevant for your work.