Daniel Borchmann
Daniel Borchmann
Research Associate, TU Dresden
Bestätigte E-Mail-Adresse bei tu-dresden.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Fast algorithms for implication bases and attribute exploration using proper premises
U Ryssel, F Distel, D Borchmann
Annals of Mathematics and Artificial Intelligence 70 (1-2), 25-53, 2014
332014
Learning terminological knowledge with high confidence from erroneous data
D Borchmann
Saechsische Landesbibliothek-Staats-und Universitaetsbibliothek Dresden, 2014
222014
Mining of EL-gcis
D Borchmann, F Distel
2011 IEEE 11th International Conference on Data Mining Workshops, 1083-1090, 2011
192011
Fast Computation of Proper Premises.
U Ryssel, F Distel, D Borchmann
CLA 959, 100-113, 2011
172011
NextClosures: Parallel Computation of the Canonical Base.
F Kriegel, D Borchmann
CLA, 181-192, 2015
162015
Axiomatisation of general concept inclusions from finite interpretations
D Borchmann, F Distel, F Kriegel
Journal of Applied Non-Classical Logics 26 (1), 1-46, 2016
132016
Some Experimental Results on Randomly Generating Formal Contexts.
D Borchmann, T Hanika
CLA 1624, 57-69, 2016
122016
A Generalized Next-Closure Algorithm--Enumerating Semilattice Elements from a Generating Set
D Borchmann
arXiv preprint arXiv:1111.3975, 2011
102011
Towards an Error-Tolerant Construction of -Ontologies from Data Using Formal Concept Analysis
D Borchmann
International Conference on Formal Concept Analysis, 60-75, 2013
82013
Towards an Error-Tolerant Construction of -Ontologies from Data Using Formal Concept Analysis
D Borchmann
International Conference on Formal Concept Analysis, 60-75, 2013
82013
On the usability of probably approximately correct implication bases
D Borchmann, T Hanika, S Obiedkov
International Conference on Formal Concept Analysis, 72-88, 2017
72017
Individuality in social networks
D Borchmann, T Hanika
Formal Concept Analysis of Social Networks, 19-40, 2017
72017
Probably approximately correct learning of Horn envelopes from queries
D Borchmann, T Hanika, S Obiedkov
Discrete Applied Mathematics 273, 30-42, 2020
62020
Axiomatizing Confident ℰℒK gfp-GCIs of Finite Interpretations
D Borchmann
Report MATH-AL-08-2012, Chair of Algebraic Structure Theory, Institute of …, 2012
62012
A general form of attribute exploration
D Borchmann
arXiv preprint arXiv:1202.4824, 2012
62012
Decomposing finite closure operators by attribute exploration
D Borchmann
ICFCA 2011, Supplementary Proceedings, 2011
62011
Concept lattice orbifolds–first steps
D Borchmann, B Ganter
International Conference on Formal Concept Analysis, 22-37, 2009
62009
Preliminary Results on the Identity Problem in Description Logic Ontologies.
F Baader, D Borchmann, A Nuradiansyah
Description Logics, 2017
52017
Towards an FCA-based recommender system for black-box optimization
J Asmus, D Borchmann, IF Sbalzarini, D Walther
Workshop Notes 35, 2014
52014
The identity problem in description logic ontologies and its application to view-based information hiding
F Baader, D Borchmann, A Nuradiansyah
Joint International Semantic Technology Conference, 102-117, 2017
42017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20