Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Paraconsistent logic programming
Theoretical Computer Science
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Paraconsistent disjunctive deductive databases
Theoretical Computer Science
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
Theory of Relational Databases
Theory of Relational Databases
A temporal paraconsistent relational algebra for incomplete and inconsistent information
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Paraconsistency in Object-Oriented Databases
Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
| Hi-index | 0.00 |
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.