Learning an extension of the class of functional dependencies with queries

DOI10.1007/s00354-015-0301-8zbMath1333.68092OpenAlexW2294395260MaRDI QIDQ264983

Víctor Lavín Puente

Publication date: 1 April 2016

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00354-015-0301-8

zbMATH Keywords

propositional formulasquery learningdata dependenciesdatabases

Mathematics Subject Classification ID

Computational learning theory (68Q32) Database theory (68P15)

Related Items (2)

Exact learning of multivalued dependency formulas ⋮ Learning sets of antecedent-restricted functional and multivalued dependencies with queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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 an extension of the class of functional dependencies with queries