Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
Machine Learning
Machine Learning
Learning Minimal Covers of Functional Dependencies with Queries
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
On learning multivalued dependencies with queries
Theoretical Computer Science
| Hi-index | 0.89 |
Data dependencies are useful to design relational databases. There is a strong connection between dependencies and some fragments of the propositional logic. In particular, functional dependencies are closely related to Horn formulas. Also, multivalued dependencies are characterized in terms of multivalued formulas. It is known that both Horn formulas and sets of functional dependencies are learnable in the exact model of learning with queries. Here we proof that neither multivalued formulas nor multivalued dependencies can be learned using only membership queries or only equivalence queries.