Learning sets of antecedent-restricted functional and multivalued dependencies with queries
From MaRDI portal
Publication:503461
DOI10.1007/s00224-015-9659-8zbMath1401.68063OpenAlexW2189082875MaRDI QIDQ503461
Publication date: 12 January 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9659-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning an extension of the class of functional dependencies with queries
- On learning multivalued dependencies with queries
- Approximate inference of functional dependencies from relations
- Learning regular sets from queries and counterexamples
- Learning conjunctions of Horn clauses
- Learning from examples and membership queries with structured determinations
- Reasoning with examples: Propositional formulae and database dependencies
- Negative results on learning multivalued dependencies with queries
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- Queries and concept learning
- Read-twice DNF formulas are properly learnable
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
- Discovery Science
- A relational model of data for large shared data banks
This page was built for publication: Learning sets of antecedent-restricted functional and multivalued dependencies with queries
