Logical Foundations of Possibilistic Keys

Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically and algorithmically. It is shown how sets of possibilistic keys can be visualized as possibilistic Armstrong relations, and how they can be discovered from given possibilistic relations. It is also shown how possibilistic keys can be used to clean dirty data by revising the belief in possibility degrees of tuples.

[1]  Sven Hartmann,et al.  Numerical constraints on XML data , 2010, Inf. Comput..

[2]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[3]  Ian Horrocks,et al.  Keys, Nominals, and Concrete Domains , 2003, IJCAI.

[4]  Diego Calvanese,et al.  Keys for Free in Description Logics , 2000, Description Logics.

[5]  Franz Baader,et al.  Proceedings of the 2000 International Workshop on Description Logics (DL2000), Aachen, Germany, August 17-19, 2000 , 2000, Description Logics.

[6]  Heikki Mannila,et al.  Algorithms for Inferring Functional Dependencies from Relations , 1994, Data Knowl. Eng..

[7]  Michel Grabisch,et al.  The correlation problem in sensor fusion in a possibilistic framework , 2001, Int. J. Intell. Syst..

[8]  Sven Hartmann,et al.  On Codd Families of Keys over Incomplete Relations , 2011, Comput. J..

[9]  Dan Geiger,et al.  Axioms and Algorithms for Inferences Involving Probabilistic Independence , 1991, Inf. Comput..

[10]  Didier Dubois,et al.  Towards a Possibilistic Logic Handling of Preferences , 1999, Applied Intelligence.

[11]  Adam J. Grove,et al.  Two modellings for theory change , 1988, J. Philos. Log..

[12]  Peter Gärdenfors,et al.  Nonmonotonic Inference Based on Expectations , 1994, Artif. Intell..

[13]  Qiang Shen,et al.  Fuzzy qualitative simulation , 1993, IEEE Trans. Syst. Man Cybern..

[14]  Bernhard Thalheim,et al.  On Semantic Issues Connected with Keys in Relational Databases Permitting Null Values , 1989, Journal of Information Processing and Cybernetics.

[15]  Paolo Papotti,et al.  Holistic data cleaning: Putting violations into context , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[16]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[17]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[18]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[19]  Patrick Bosc,et al.  On the impact of regular functional dependencies when moving to a possibilistic database framework , 2003, Fuzzy Sets Syst..

[20]  Jérôme Lang,et al.  Towards qualitative approaches to multi-stage decision making , 1998, Int. J. Approx. Reason..

[21]  Jim Diederich,et al.  New methods and fast algorithms for database normalization , 1988, TODS.

[22]  Francesca Rossi,et al.  Abstracting soft constraints: Framework, properties, examples , 2002, Artif. Intell..

[23]  Didier Dubois,et al.  Fuzzy functional dependencies-an overview and a critical discussion , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.

[24]  Guilin Qi,et al.  Conflict-Based Belief Revision Operators in Possibilistic Logic , 2012, AAAI.

[25]  Gyula O. H. Katona,et al.  Extremal Combinatorial Problems of Database Models , 1987, MFDBS.

[26]  Didier Dubois,et al.  Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision, and Variable Certainty Weights , 1994, IEEE Trans. Knowl. Data Eng..

[27]  Christopher Ré,et al.  Probabilistic databases , 2011, SIGA.

[28]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[29]  Jennifer Widom,et al.  Schema Design for Uncertain Databases , 2007, AMW.

[30]  Felix Naumann,et al.  Scalable Discovery of Unique Column Combinations , 2013, Proc. VLDB Endow..

[31]  Marc Gyssens,et al.  On the conditional independence implication problem: A lattice-theoretic approach , 2008, Artif. Intell..

[32]  Didier Dubois,et al.  Epistemic Entrenchment and Possibilistic Logic , 1991, Artif. Intell..

[33]  Lotfi A. Zadeh,et al.  Approximate Reasoning Based on Fuzzy Logic , 1979, IJCAI.

[34]  Bernhard Thalheim,et al.  Proceedings on Mathematical Fundamentals of Database Systems on MFDBS 87 , 1988 .

[35]  Sven Hartmann,et al.  Design by example for SQL table definitions with functional dependencies , 2012, The VLDB Journal.

[36]  Dan Suciu,et al.  Query evaluation with soft-key constraints , 2008, PODS.

[37]  Steven Schockaert,et al.  Stable Models in Generalized Possibilistic Logic , 2012, KR.

[38]  Richard Statman,et al.  On the Structure of Armstrong Relations for Functional Dependencies , 1984, JACM.

[39]  DiederichJim,et al.  New methods and fast algorithms for database normalization , 1988 .

[40]  Didier Dubois,et al.  Fuzzy set and possibility theory-based methods in artificial intelligence , 2003, Artif. Intell..

[41]  David Toman,et al.  On Keys and Functional Dependencies as First-Class Citizens in Description Logics , 2006, IJCAR.

[42]  Sven Hartmann,et al.  Efficient reasoning about a robust XML key fragment , 2009, TODS.

[43]  Lukasz Golab,et al.  Sampling the repairs of functional dependency violations under hard constraints , 2010, Proc. VLDB Endow..