Probably approximately correct learning of Horn envelopes from queries
From MaRDI portal
Publication:2286380
DOI10.1016/j.dam.2019.02.036zbMath1430.68261arXiv1807.06149OpenAlexW2963405957WikidataQ128206461 ScholiaQ128206461MaRDI QIDQ2286380
Tom Hanika, Daniel Borchmann, Sergei Obiedkov
Publication date: 22 January 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06149
Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)
Related Items
From equivalence queries to PAC learning: the case of implication theories ⋮ Algebraic machine learning: emphasis on efficiency ⋮ Approximate computation of exact association rules
Uses Software
Cites Work
- Construction and learnability of canonical Horn formulas
- Learning definite Horn formulas from closure queries
- On generating all maximal independent sets
- Learning conjunctions of Horn clauses
- Horn approximations of empirical data
- Queries and concept learning
- Conceptual Exploration
- Probability Inequalities for Sums of Bounded Random Variables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
