Possibilistic keys

DOI10.1016/j.fss.2019.01.008zbMath1423.94049OpenAlexW4206248846MaRDI QIDQ2329094

Sebastian Link, Nishita Balamuralikrishna, Uwe Leck, Henri Prade, Yingnan Jiang, Henning Koehler

Publication date: 17 October 2019

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://oatao.univ-toulouse.fr/25041/1/balamuralikrishna_25041.pdf

zbMATH Keywords

databasepossibility theoryuncertain dataextremal combinatoricsimplicationaxiomatizationArmstrong relationkeydiscoveryconstraint maintenance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Controlling entity integrity with key sets

Uses Software

• UCI-ml

Cites Work

• Fundamentals of parameterized complexity
• Design by example: An application of Armstrong relations
• Numerical constraints on XML data
• Axioms and algorithms for inferences involving probabilistic independence
• Refinements of the maximum approach to decision-making in a fuzzy environment
• Automated reasoning about key sets
• On the conditional independence implication problem: a lattice-theoretic approach
• Possibilistic Conditional Tables
• Logical Foundations of Possibilistic Keys
• Probabilistic Databases
• On the Structure of Armstrong Relations for Functional Dependencies
• Horn clauses and database dependencies
• Algorithms for inferring functional dependencies from relations
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Possibilistic keys