On Databases with Incomplete Information
From MaRDI portal
Publication:3916039
DOI10.1145/322234.322239zbMath0464.68086OpenAlexW1994581962MaRDI QIDQ3916039
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322234.322239
databasemodal logicincomplete informationrelational modelnull valuesimplicit informationquery language semantics
Abstract data types; algebraic specification (68Q65) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)
Related Items
A deontic approach to database integrity ⋮ Towards an understanding of cloud services under uncertainty: a possibilistic approach ⋮ Incrementally updating approximations based on the graded tolerance relation in incomplete information tables ⋮ Set-valued ordered information systems ⋮ Rough Sets in Incomplete Information Systems with Order Relations Under Lipski’s Approach ⋮ Twofold rough approximations under incomplete information ⋮ Variable consistency and variable precision models for dominance-based fuzzy rough set analysis of possibilistic information systems ⋮ Null values in nested relational databases ⋮ Rough set-based logics for multicriteria decision analysis ⋮ Information granulation and rough set approximation ⋮ A Uniform Framework for Rough Approximations Based on Generalized Quantifiers ⋮ Models of approximation in databases ⋮ On the relation between possibilistic logic and modal logics of belief and knowledge ⋮ Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values ⋮ Bireducts with tolerance relations ⋮ Gradualness, uncertainty and bipolarity: making sense of fuzzy sets ⋮ Grey sets and greyness ⋮ Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information ⋮ Dominance-based fuzzy rough set analysis of uncertain and possibilistic data tables ⋮ Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems ⋮ Fuzzy rough set model for set-valued data ⋮ Fuzzy hypothesis testing for a population proportion based on set-valued information ⋮ On the representation and querying of sets of possible worlds ⋮ A MATHEMATICAL EXTENSION OF ROUGH SET-BASED ISSUES TOWARD UNCERTAIN INFORMATION ANALYSIS ⋮ Approximate reasoning by analogy to answer null queries ⋮ Attribute Reduction of Incomplete Information Systems: An Intuitionistic Fuzzy Rough Set Approach ⋮ Families of the Granules for Association Rules and Their Properties ⋮ Entropy measures and granularity measures for set-valued information systems ⋮ Uncertainty measurement for interval-valued information systems ⋮ Semi-monolayer covering rough set on set-valued information systems and its efficient computation ⋮ Towards optimal use of incomplete classification data ⋮ Attribute reduction based on evidence theory in incomplete decision systems ⋮ Proof-theoretic notions for software maintenance ⋮ About the processing of possibilistic queries involving a difference operation ⋮ Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects ⋮ Set-valued information systems ⋮ Foundations of near sets ⋮ On rule acquisition in incomplete multi-scale decision tables ⋮ Feature selection and approximate reasoning of large-scale set-valued decision tables based on \(\alpha\)-dominance-based quantitative rough sets ⋮ Three-way decision with incomplete information based on similarity and satisfiability ⋮ An Approach Based on Rough Sets to Possibilistic Information ⋮ Rough set approach to multiple criteria classification with imprecise evaluations and assignments ⋮ A fuzzy similarity-based rough set approach for attribute selection in set-valued information systems ⋮ Fuzzy information in extended fuzzy relational databases ⋮ Rules and Apriori Algorithm in Non-deterministic Information Systems ⋮ ON A THEOREM PROVER FOR VARIATIONAL LOGIC PROGRAMS WITH FUNCTORS SETU AND SETS ⋮ On similarity relations in fuzzy relational databases ⋮ Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries ⋮ Approximate keys and functional dependencies in incomplete databases with limited domains
