Imperfect Information in Relational Databases

Databases model the real world at two levels: the database schema specifies the structure of the database, and the database extension represents a set of facts or events of the real world. The Appropriate Scheme Assumption [10] expresses that this two-level description is a valid view of the world. Such a distinction between schema and extension is often blurred in artificial intelligence.

[1]  Peter Honeyman,et al.  Testing satisfaction of functional dependencies , 1982, JACM.

[2]  Serge Abiteboul,et al.  Update Semantics for Incomplete Databases , 1985, VLDB.

[3]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[4]  Witold Lipski,et al.  On semantic issues connected with incomplete information databases , 1979, ACM Trans. Database Syst..

[5]  Paolo Atzeni,et al.  Approaches to Updates over Weak Instances , 1989, MFDBS.

[6]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[7]  Alain Pirotte,et al.  Incomplete and uncertain information in relational databases , 1992 .

[8]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[9]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[10]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[11]  Hector Garcia-Molina,et al.  The Management of Probabilistic Data , 1992, IEEE Trans. Knowl. Data Eng..

[12]  John Grant,et al.  Null Values in a Relational Data Base , 1977, Inf. Process. Lett..

[13]  Serge Abiteboul,et al.  On the Representation and Querying of Sets of Possible Worlds , 1991, Theor. Comput. Sci..

[14]  Marianne Winslett.  Updating Logical Databases Containing Null Values , 1986, ICDT.

[15]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[16]  Teodor C. Przymusinski,et al.  The extended closed world assumption and its relationship to parallel circumscription , 1985, PODS '86.

[17]  Hector Garcia-Molina,et al.  A Probalilistic Relational Data Model , 1990, EDBT.

[18]  E. F. Codd,et al.  Understanding Relations (Installment #7) , 1974, FDT Bull. ACM SIGFIDET SIGMOD.

[19]  Serge Abiteboul,et al.  Non First Normal Form Relations: An Algebra Allowing Data Restructuring , 1986, J. Comput. Syst. Sci..

[20]  Zbigniew Michalewicz,et al.  Sets and Uncertainty in Relational Databases , 1988, IPMU.

[21]  Yannis Vassiliou.  Functional Dependencies and Incomplete Information , 1980, VLDB.

[22]  A framework for comparison of update semantics , 1988, PODS '88.

[23]  Tomasz Imielinski,et al.  Incomplete information and dependencies in relational databases , 1983, SIGMOD '83.

[24]  Mark Levene,et al.  The Nested Universal Relation Database Model , 1992, Lecture Notes in Computer Science.

[25]  Raymond Reiter,et al.  A sound and sometimes complete query evaluation algorithm for relational databases with null values , 1986, JACM.

[26]  Witold Lipski.  On relational algebra with marked nulls preliminary version , 1984, PODS '84.

[27]  Erol Gelenbe,et al.  A probability model of uncertainty in data bases , 1986, 1986 IEEE Second International Conference on Data Engineering.

[28]  David Maier,et al.  Maximal objects and the semantics of universal relation databases , 1983, TODS.

[29]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[30]  E. F. Codd.  More commentary on missing information in relational databases (applicable and inapplicable information) , 1987, SGMD.

[31]  Rajshekhar Sunderraman,et al.  On representing indefinite and maybe information in relational databases: a generalization , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[32]  Witold Lipski,et al.  On Databases with Incomplete Information , 1981, JACM.

[33]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[34]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[35]  Peter J. H. King,et al.  Default Databases and Incomplete Information , 1991, Comput. J..

[36]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[37]  Gösta Grahne,et al.  The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.

[38]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[39]  Li-Yan Yuan,et al.  A sound and complete query evaluation algorithm for relational databases with null values , 1988, SIGMOD '88.

[40]  Jeffrey D. Ullman,et al.  Universal Relation Interfaces for Database Systems , 1983, IFIP Congress.

[41]  Joachim Biskup,et al.  A Formal Approach to Null Values in Database Relations , 1979, Advances in Data Base Theory.

[42]  Yannis Vassiliou,et al.  Null values in data base management a denotational semantics approach , 1979, SIGMOD '79.

[43]  Raymond Reiter.  On Asking What a Database Knows , 1990 .

[44]  E. F. Codd,et al.  Missing information (applicable and inapplicable) in relational databases , 1986, SGMD.

[45]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[46]  Marianne Winslett,et al.  A model-based approach to updating databases with incomplete information , 1988, TODS.

[47]  Carlo Zaniolo,et al.  Database relations with null values , 1982, J. Comput. Syst. Sci..

[48]  Nadine Lerat.  Query Processing in Incomplete Logical Databases , 1986, ICDT.

[49]  Esteban Zimányi,et al.  Query Evaluation in Probabilistic Relational Databases , 1997, Theor. Comput. Sci..

[50]  Gösta Grahne,et al.  Dependency Satisfaction in Databases with Incomplete Information , 1984, VLDB.

[51]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[52]  Paolo Atzeni,et al.  A New Interpretation for Null Values in the Weak Instance Model , 1990, J. Comput. Syst. Sci..

[53]  Jack Minker,et al.  Toward A Foundation of Disjunctive Logic Programming , 1989, NACLP.

[54]  Georg Gottlob,et al.  Closed World Databases Opened Through Null Values , 1988, VLDB.

[55]  John Grant,et al.  Answering Queries in Indefinite Databases and the Null Value Problem , 1986, Adv. Comput. Res..

[56]  Tomasz Imielinski,et al.  Complexity of query processing in databases with OR-objects , 1989, PODS '89.

[57]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[58]  Rajshekhar Sunderraman,et al.  Indefinite and maybe information in relational databases , 1990, TODS.

[59]  Witold Lipski.  On Relational Algebra with Marked Nulls. , 1984, PODS 1984.

[60]  Akifumi Makinouchi,et al.  A Consideration on Normal Form of Not-Necessarily-Normalized Relation in the Relational Data Model , 1977, VLDB.

[61]  Michael Pittarelli,et al.  The Theory of Probabilistic Databases , 1987, VLDB.

[62]  Ronald Fagin,et al.  Uncertainty, belief, and probability , 1989, IJCAI 1989.

[63]  Michael Gelfond,et al.  Negation as Failure: Careful Closure Procedure , 1986, Artif. Intell..

[64]  Tomasz Imielinski.  Query processing in deductive databases with incomplete information , 1986, SIGMOD '86.

[65]  Joseph Y. Halpern.  An Analysis of First-Order Logics of Probability , 1989, IJCAI.

[66]  David Maier,et al.  On the foundations of the universal relation model , 1984, TODS.

[67]  Michael L. Brodie,et al.  On Conceptual Modelling , 1984, Topics in Information Systems.

[68]  Jack Minker,et al.  Disjunctive Deductive Databases , 1992, LPAR.

[69]  Tore Risch,et al.  A functional approach to integrating database and expert systems , 1988, CACM.

[70]  Luis Fariñas del Cerro,et al.  An Algebraic Evaluation Method for Deduction in Incomplete Data Bases , 1988, J. Log. Program..

[71]  Joachim Biskup,et al.  A foundation of CODD's relational maybe-operations , 1983, TODS.

[72]  Jeffrey D. Ullman,et al.  The U. R. strikes back , 1982, PODS.