15 citations · 35 across the 7 of their papers we have counts for
7 papers
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…
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…
Abstract Attribute Exploration with Partial Object Descriptions
Daniel Borchmann, Bernhard Ganter
Attribute exploration has been investigated in several studies, with particular emphasis on the algorithmic aspects of this knowledge acquisition method. In its basic version the m…
Topological Entropy of Formal Languages
Friedrich Martin Schneider, Daniel Borchmann
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this…
A General Form of Attribute Exploration
Daniel Borchmann
We present a general form of attribute exploration, a knowledge completion algorithm from Formal Concept Analysis. The aim of our presentation is not only to extend the applicabili…
Deciding Entailment of Implications with Support and Confidence in Polynomial Space
Daniel Borchmann
Association Rules are a basic concept of data mining. They are, however, not understood as logical objects which can be used for reasoning. The purpose of this paper is to investig…
A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set
Daniel Borchmann
We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the inten…