Abstract
Paraconsistent information is information that is incomplete and/or inconsistent. A data model for representing and manipulating paraconsistent information in relational databases has recently been developed. Algebraic operators on the underlying paraconsistent relations of this model are generalizations of the usual ones on ordinary relations. However, unlike in the ordinary case, a DBMS based on paraconsistent relations must be capable of handling infinite relations. In this paper, we show this necessity and identify classes of infinite paraconsistent relations whose members can be effectively represented and manipulated. We show that the classes of REGULAR and, under different conditions, CONTEXT-SENSITIVE as well as PSPACE paraconsistent relations are such. We also show that the CONTEXT-FREE and R.E. classes do not have the desired properties, while P, NP, LOGSPACE and NLOGSPACE also probably do not. These results help identify the kinds of relational DBMS that can be constructed for handling incomplete and inconsistent information about tuples.
Abstract
This research has been partially supported by the National Science Foundation research grant no. IRI 96-28866.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Bagai, and M. A. Orgun. A temporal paraconsistent relational algebra for incomplete and inconsistent information. In Proc. 33rd Annual ACM Southeast Conference, pages 240–248, 1995.
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.
C. Baral, S. Kraus, and J. Minker. Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering, 3(2):208–220, 1991.
N. D. Belnap. A useful four-valued logic. In G. Epstein and J. M. Dunn, editors, Modern Uses of Many-valued logic, pages 8–37. Reidel, Dordrecht, 1977.
H. A. Blair, and V. S. Subrahmanian. Paraconsistent logic programming. Theoretical Computer Science, 68:135–154, 1989.
A. K. Chandra, D. K. Kozen, and J. Stockmeyer. Alternation. JACM, 28(1):114–133, 1981.
E. F. Codd. A relational model for shared data banks. CACM, 13(6):377–387, 1970.
E. F. Codd. Missing information (applicable and inapplicable) in relational databases. SIGMOD Record, 15(4):53–78, 1986.
N. C. A. da Costa. On the theory of inconsistent formal systems. Notre Dame Journal of Formal Logic, 15:497–510, 1974.
J. Hartmanis, P. M. Lewis II, and R. E. Stearns. Hierarchies of memory limited computations. In Proc. 6th Annual IEEE Symp. on Switching Circuit Theory and Logical Design, pages 179–190, 1965.
J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
T. Imielinski, and W. Lipski. Incomplete information in relational databases. JACM, 31(4):761–791, 1984.
P. Kanellakis. Elements of relational database theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B (Formal Models and Semantics), pages 1073–1156. The MIT Press, Cambridge, Mass., 1990.
D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.
V. S. Subrahmanian. Paraconsistent disjunctive deductive databases. Theoretical Computer Science, 93:115–141, 1992.
V. S. Subrahmanian. Amalgamating knowledge bases. ACM Transactions on Database Systems, 19(2):291–331, 1994.
R. Sunderraman and R. Bagai. Uncertainty and inconsistency in relational databases. In S. Chaudhuri, A. Deshpande and R. Krishnamurthy, editors, Advances in Data Management, pages 206–220. Tata McGraw Hill Publishing, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tran, N., Bagabi, R. (1999). Infinite Relations in Paraconsistent Databases. In: Eder, J., Rozman, I., Welzer, T. (eds) Advances in Databases and Information Systems. ADBIS 1999. Lecture Notes in Computer Science, vol 1691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48252-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-48252-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66485-7
Online ISBN: 978-3-540-48252-9
eBook Packages: Springer Book Archive