Tuple Relational Calculus for Paraconsistent Databases
- Rajiv Bagai
- … show all 1 hide
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
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.
- R. Bagai and R. Sunderraman. A paraconsistent relational data model. International Journal of Computer Mathematics, 55(1):39–55, 1995. CrossRef
- 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. CrossRef
- 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. CrossRef
- 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. CrossRef
- N. C. A. da Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic, 15:621–630, 1977. CrossRef
- V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2):291–331, 1994. CrossRef
- 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.
- Tuple Relational Calculus for Paraconsistent Databases
- Book Title
- Advances in Artificial Intelligence
- Book Subtitle
- International Joint Conference 7th Ibero-American Conference on AI 15th Brazilian Symposium on AI IBERAMIA-SBIA 2000 Atibaia, SP, Brazil, November 19–22, 2000 Proceedings
- pp 409-416
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Relational data model
- Incomplete and inconsistent information
- Tuple relational calculus
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. Department of Computer Science and Statistics Computational Intelligence Laboratory, University of São Paulo
- 2. Computer Engineering Department Intelligent Techniques Laboratory, University of São Paulo
- Rajiv Bagai (5)
- Author Affiliations
- 5. Department of Computer Science, Wichita State University, KS 67260-0083, Wichita, USA
To view the rest of this content please follow the download PDF link above.