ABSTRACT
In this paper, the results obtained thus far in an ongoing research effort devoted to the modeling of indefinite information is presented. Specifically, an extended relational model coined E-tables for representing exclusive indefinite type model coined information is described. The semantic, or information content, of E-tables is precisely defined. Both syntactic and semantic definitions of the extended relational algebra operators of selection, projection, and Cartesian product are defined to deal with E-tables. Redundancies that might occur in E-tables are identified. Furthermore, relationships among E-tables, the Generalized Closed World Assumptions, and negations are explored.
- 1.Biskup, }. "A Formal Approach to Null Values in Datatm~ Relations," Advances in Database ~, H. Gallaire, I. Minker, and J. M. Nicolas, Eds., Vol. 1, 1981, PP. 299-341.]]Google Scholar
- 2.Biskup. J. "Foundations of Codd's Relational Maybe Operations," ACM Transactions on Database Systems, Vol. 8, No. 4, 1983, pp. 608-636.]] Google ScholarDigital Library
- 3.Buckles, B.P. and Petty, F.E. "Fuzzy Databases and Their Applicttions," Fuzzy Information and Decision Processes, M.M. Gupta and E. Sanche.z, Eds, 1982, pp. 361-371.]]Google Scholar
- 4.Buckles, B.P. and Perry, F.E. "A Fuzzy Representation of Data for Relational Datatatses," Fuzzy Sets and Systems, 7, 1982, plx 213-226.]]Google ScholarCross Ref
- 5.Buckles, B.P. and Perry, P.E. "Extending the Fuzzy Database with Fuzzy Numbers," Information Sicence, 34, 1982, pp. 145- 155.]]Google ScholarCross Ref
- 6.Clark, K. "Negation as Failure," Logic and Databases, H. Gallaire and J. Minker, Eds., Plenum, 1978, pp. 293-322.]]Google Scholar
- 7.Codd, E.F. "Understanding Relations," FDT Bulletin of ACM-SIGMOD, Vol. 7, 1975, pp. 23-28.]] Google ScholarDigital Library
- 8.Codd, E.F. "Extending the Database Relational Model to Capture More Meaning," ACM Transactions on Database Systems, Vol. 4, No. 4, 1979, pp. 397-434.]] Google ScholarDigital Library
- 9.Codd, E.F. "A Relational Model for Large Shared Data Banks," Communications of the ACM, Vol. 13, No. 6, June 1970, pp. 377-387.]] Google ScholarDigital Library
- 10.Gallaire, H., Minker, J., and Nicolas, J.M. "Logic and Databases: A Deductive Approach," ACM Computing Survery, 16, 2, June 1984, pp. 151-184.]] Google ScholarDigital Library
- 11.Van Gelder, A. "Negation as Failure Using Tight Derivations for General Logic Programming," Foundations of Deductive Databases and Logic Programming, J. Minker, Ed., pp. 149-176.]] Google ScholarDigital Library
- 12.Grant, J. "Partial Values in a Tabular Database ModeL" Information Processing Letter, 9, 2, August 1979, pp. 97-99.]]Google ScholarCross Ref
- 13.Grant, J. and Minker, J. 'The Impact of Logic Programming on Databases," Communications of the ACM, Vol. 3, No. 3, pp. 67-81.]] Google ScholarDigital Library
- 14.Henschen, L.J. and ParL H. "Compliling the GCWA in Indefinite ~five Databases," Foundations of Deductive Databases and Logic Programming, J. Minker, Ed., pp. 395-438.]] Google ScholarDigital Library
- 15.Henschen, L.J. and Yahya, A. "~ction in Non-Horn Databases," Journal of Automated Reasoning, 1, 1985, pp. 395- 438.]]Google Scholar
- 16.Imielinski, T. and Lipski, W. "incomplete Information in Relational Databases," Journal of the ACM, Vol. 31, No. 4, October 1984, pp. 761-791.]] Google ScholarDigital Library
- 17.Imielinski, T. "Incomplete Information in Logical Databa.q~," Bulletin of the IEEE Tech. Committee on Data Engineering, Vol. 12, No. 2, 1989, pp. 29-40.]]Google Scholar
- 18.KowaLski, R. "Logic for Data Description," Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum, 1978, pp. 77-103.]]Google Scholar
- 19.Lipski, W. "On Semantic Issues Connected with Incomplete Information," ACM Transaction on Database Systems, Vol. 4, No. 3, September 1979, pp. 262-296.]] Google ScholarDigital Library
- 20.Liu, K.C. and Stmderraman, R. "On Representing Indefinite and Maybe Information in Relational Databases," Pr~ings of the Fourth International Conference on Data Engineering, Los Angles, CA, February 2-4, 1988, pp. 250-257.]] Google ScholarDigital Library
- 21.Liu, ICC. and Sundetrmnan, R. "On Representing hdefinite and Maybe Inf~on in Relational Damlmus: A Generalization," Proceedings of the sixth Intematimml Conf~ on Data Engineering, Los Angle~ CA, F~ 5-9, 1990, pp. 495-502.]] Google ScholarDigital Library
- 22.Lie, K.C. and Stmderraman. R. "Imlefiniu: and M~be Information in Relational Databases," ACM Transactiom on Database Systen~, Vol. 15, No. 1, March 1990, pp. 1-39.]] Google ScholarDigital Library
- 23.Liu, K.C. and Sunderraman, R. "A Gemralized Relational Model for Indefinite and Maybe Information," IEEE Tnmsactimu; on Knowledge and Data Engineerin8. VoL 3, No. 1, March 1991.]] Google ScholarDigital Library
- 24.Liu K.C., and Zhang L. "Nanaal Joins in Relational Databases with Indefinite and Maybe Infmmallon", Pmceedin~ of the Seventh International Conference on Data Eng~g, Kobe, Japan, April 8-12, 1991, pp. 132-139.]] Google ScholarDigital Library
- 25.Michalewicz, Z. and Groves, l.,.J. "Sets and Uncertainty in Relational Databases," Lecture Notes in Computer Sc~ 313, Go~, G. and Hamnm6s, J., Eds,, pp. 127-137.]] Google ScholarDigital Library
- 26.Minker, J. "On Indefinite Databases and the Closed World Assumption," Proceedings of the Sixth Conference on CADE, D. Loveland, Ed., Springer-Verlag ~e Notes in Computer Science, No. 138, 1982, pp. 292-308.]] Google ScholarDigital Library
- 27.Minke~, J. and Perlis, D. "Applications of Protected Circumscription," Proceedings of the Conference of Automated Deduction, Sta~ger-Verlag, 1984, pp. 414-425.]] Google ScholarDigital Library
- 28.Mohany, H. and Sildossy, I,. "lnccanplete Data~tea and Some Applications," Relxa't, Vrije Universiteit Amstealam, October, 1988.]]Google Scholar
- 29.Przymusinski, T.C. "On the Declaratice Semantics of Deductive Databases and Logic Programs," Foundatiom of ~cfive Databases and Logic Programming, J. Minkef, Ed., pp. 193-216.]] Google ScholarDigital Library
- 30.Reiter, R. "On Closed World Data Bases," Logic and Databases, H. Ga}iaire and J. Minker, Eds. Plenum, 1978, pp. 56-76.]]Google Scholar
- 31.Reiter, R. "Towards a Logical Reconsmmtion of Relational Database Theory," On Conceptual Modeling, pp. 191-233.]]Google Scholar
- 32.Shenoi, S. and Melton. A. "An Extended Version of the Fuzzy Relational Database Model," Information Sciemes, 52, 1990, pp. 35-52.]] Google ScholarDigital Library
- 33.Shepherdo~ J.H. "Negation in Logic Programming." Foundations of Deductive Databases and Logic Programmhtg, L Minker, Ed., pp. 19-88.]] Google ScholarDigital Library
- 34.Vassiliou, Y. "Null Values in Database Management: A Denotational Semantics Approach," Proceedings of ACM- SIGMOD 1979, pp. 162-169.]] Google ScholarDigital Library
- 35.Yahya, A. and Hens~en, L.J. "Deduction in Non-Horn Databases," Journal of Automated Reasoning, I, 1985, pp. 141- 160.]]Google Scholar
- 36.Zaniolo, C. "Database Systems with Null Values," Journal of Computer and System Sciences, Vol. 28, 1984, pp. 142-166.]]Google ScholarCross Ref
- 37.L.A. "Fuzzy Sets," Information and Control 8, 1965, pp. 338-353.]]Google ScholarCross Ref
Index Terms
- Towards a relational model for exclusively disjunctive information
Recommendations
On stratified disjunctive programs
We address the problem of a consistent fixpoint semantics for general disjunctive programs restricted to stratifiable programs which do not recurse through negative literals. We apply the nonmonotonic fixpoint theory developed by Apt, Blair and Walker ...
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
It is wellknown that Minker's semantics GCWA for positive disjunctive programs P, i.e. to decide if a literal is true in all minimal models of P is Π P 2-complete. This is in contrast to the same entailment problem for semantics of non-disjunctive ...
Comments