Construction and learnability of canonical Horn formulas

DOI10.1007/s10994-011-5248-5zbMath1237.68106OpenAlexW2060706274MaRDI QIDQ415621

Marta Arias, José L. Balcázar

Publication date: 8 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-011-5248-5

zbMATH Keywords

canonical representationquery learningHorn formulas

Mathematics Subject Classification ID

Computational learning theory (68Q32) Logic in artificial intelligence (68T27)

Related Items (10)

From equivalence queries to PAC learning: the case of implication theories ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Unique key Horn functions ⋮ Learning definite Horn formulas from closure queries ⋮ Hydras: directed hypergraphs and Horn formulas ⋮ Optimizations in computing the Duquenne-Guigues basis of implications ⋮ Unnamed Item ⋮ Probably approximately correct learning of Horn envelopes from queries ⋮ Unnamed Item ⋮ Approximate computation of exact association rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate inference of functional dependencies from relations
• Classic learning
• The multiple facets of the canonical direct unit implicational basis
• Learning regular sets from queries and counterexamples
• Learning conjunctions of Horn clauses
• Flattening and saturation: Two representation changes for generalization
• A theory of finite closure spaces based on implications
• Learning closed Horn expressions
• When won't membership queries help?
• Negative results on learning multivalued dependencies with queries
• Polynomial certificates for propositional classes
• Reasoning with models
• Toward Mechanical Mathematics
• Query Learning and Certificates in Lattices
• Canonical Horn Representations and Query Learning
• A theory of the learnable
• Minimum Covers in Relational Database Model
• Knowledge compilation and theory approximation
• How many queries are needed to learn?
• Mathematical Foundations of Computer Science 2005
• On sentences which are true of direct unions of algebras
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: Construction and learnability of canonical Horn formulas