15 citations · 30 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2018★ 15 cited
Probably approximately correct learning of Horn envelopes from queries
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attrib…
cs.AI2017★ 7 cited
On the Usability of Probably Approximately Correct Implication Bases
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the g…