Daniel Borchmann

30 papers B 2C 7Journal 9Unranked 10
YearRankTypeTitle / Venue / Authors
2020 J jnl
Probably approximately correct learning of Horn envelopes from queries.
Discret. Appl. Math.
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2018 J jnl
Probably approximately correct learning of Horn envelopes from queries.
CoRR
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 C ed.
Formal Concept Analysis - 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings
ICFCA
Karell Bertet, Daniel Borchmann, Peggy Cellier, Sébastien Ferré
2017 C conf
Implications and Dependencies Between Attributes.
ICFCA
Bernhard Ganter, Rudolf Wille, Daniel Borchmann, Juliane Prochaska
2017 — ch.
Individuality in Social Networks.
Formal Concept Analysis of Social Networks
Daniel Borchmann, Tom Hanika
2017 J jnl
NextClosures: parallel computation of the canonical base with background knowledge.
Int. J. Gen. Syst.
Francesco Kriegel, Daniel Borchmann
2017 C conf
On the Usability of Probably Approximately Correct Implication Bases.
ICFCA
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 J jnl
On the Usability of Probably Approximately Correct Implication Bases.
CoRR
Daniel Borchmann, Tom Hanika, Sergei Obiedkov
2017 — conf
Preliminary Results on the Identity Problem in Description Logic Ontologies.
Description Logics
Franz Baader, Daniel Borchmann, Adrian Nuradiansyah
2017 — conf
The Identity Problem in Description Logic Ontologies and Its Application to View-Based Information Hiding.
JIST
Franz Baader, Daniel Borchmann, Adrian Nuradiansyah
2016 J jnl
Axiomatisation of general concept inclusions from finite interpretations.
J. Appl. Non Class. Logics
Daniel Borchmann, Felix Distel, Francesco Kriegel
2016 — conf
Some Experimental Results on Randomly Generating Formal Contexts.
CLA
Daniel Borchmann, Tom Hanika
2015 J jnl
Abstract Attribute Exploration with Partial Object Descriptions.
CoRR
Daniel Borchmann, Bernhard Ganter
2015 C conf
Exploring Faulty Data.
ICFCA
Daniel Borchmann
2015 — conf
NextClosures: Parallel Computation of the Canonical Base.
CLA
Francesco Kriegel, Daniel Borchmann
2014 C conf
Attribute Exploration with Proper Premises and Incomplete Knowledge Applied to the Free Radical Theory of Ageing.
ICFCA
Johannes Wollbold, Rüdiger Köhling, Daniel Borchmann
2014 J jnl
Fast algorithms for implication bases and attribute exploration using proper premises.
Ann. Math. Artif. Intell.
Uwe Ryssel, Felix Distel, Daniel Borchmann
2014 — conf
Learning Terminological Knowledge with High Confidence from Erroneous Data.
Joint Workshop of the German Research Training Groups in Computer Science
Daniel Borchmann
2014 — —
Learning terminological knowledge with high confidence from erroneous data.
Daniel Borchmann
2014 — conf
Towards an FCA-based Recommender System for Black-Box Optimization.
FCA4AI@ECAI
Josefine Asmus, Daniel Borchmann, Ivo F. Sbalzarini, Dirk Walther
2013 — conf
Axiomatizing Confident EL^bot_gfp-General Concept Inclusions in the Presence of Untrusted Individuals.
Description Logics
Daniel Borchmann
2013 B conf
Axiomatizing ε
K-CAP
Daniel Borchmann
2013 B conf
Experience Based Nonmonotonic Reasoning.
LPNMR
Daniel Borchmann
2013 C conf
Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis.
ICFCA
Daniel Borchmann
2012 J jnl
A General Form of Attribute Exploration
CoRR
Daniel Borchmann
2012 — conf
A Generalized Next-Closure Algorithm - Enumerating Semilattice Elements from a Generating Set.
CLA
Daniel Borchmann
2012 J jnl
Deciding Entailment of Implications with Support and Confidence in Polynomial Space
CoRR
Daniel Borchmann
2011 — conf
Fast Computation of Proper Premises.
CLA
Uwe Ryssel, Felix Distel, Daniel Borchmann
2011 — conf
Mining of EL-GCIs.
ICDM Workshops
Daniel Borchmann, Felix Distel
2009 C conf
Concept Lattice Orbifolds - First Steps.
ICFCA
Daniel Borchmann, Bernhard Ganter