Exact learning of multivalued dependency formulas

DOI10.1016/j.tcs.2017.11.018zbMath1388.68031OpenAlexW2773585566MaRDI QIDQ1704556

Ana Ozaki, Montserrat Hermo

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.018

zbMATH Keywords

exact learningmultivalued dependencies2-quasi-Horn

Mathematics Subject Classification ID

Computational learning theory (68Q32) Database theory (68P15) Logic in computer science (03B70)

Cites Work

• Learning an extension of the class of functional dependencies with queries
• On learning multivalued dependencies with queries
• Learning conjunctions of Horn clauses
• 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
• Unnamed Item

This page was built for publication: Exact learning of multivalued dependency formulas