Reasoning with examples: Propositional formulae and database dependencies

DOI10.1007/S002360050161MaRDI QIDQ1306568zbMATH OpenOpenAlexFDO

Authors Roni Khardon, Heikki Mannila, Daniel Roth

Publication date 9 November 1999

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL http://nrs.harvard.edu/urn-3:HUL.InstRepos:25620470

zbMATH Keywords

database dependencies

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 1501628
• scientific article; zbMATH DE number 1507283
• Design by example: An application of Armstrong relations
• Weak functional dependencies: full propositional expressiveness for the database practitioner

Cited in

(9)

• On functional dependencies in q-Horn theories
• Exact learning of multivalued dependency formulas
• Negative results on learning multivalued dependencies with queries
• Learning an extension of the class of functional dependencies with queries
• Exact Learning of Multivalued Dependencies
• Characterisations of multivalued dependency implication over undetermined universes
• Learning sets of antecedent-restricted functional and multivalued dependencies with queries
• On learning multivalued dependencies with queries
• The complexity of reasoning with FODD and GFODD

This page was built for publication: Reasoning with examples: Propositional formulae and database dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306568)