default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Borchmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j4]Daniel Borchmann, Tom Hanika
, Sergei Obiedkov:
Probably approximately correct learning of Horn envelopes from queries. Discret. Appl. Math. 273: 30-42 (2020)
2010 – 2019
- 2018
- [i5]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
Probably approximately correct learning of Horn envelopes from queries. CoRR abs/1807.06149 (2018) - 2017
- [j3]Francesco Kriegel, Daniel Borchmann:
NextClosures: parallel computation of the canonical base with background knowledge. Int. J. Gen. Syst. 46(5): 490-510 (2017) - [c18]Franz Baader, Daniel Borchmann, Adrian Nuradiansyah:
Preliminary Results on the Identity Problem in Description Logic Ontologies. Description Logics 2017 - [c17]Bernhard Ganter, Rudolf Wille, Daniel Borchmann, Juliane Prochaska:
Implications and Dependencies Between Attributes. ICFCA 2017: 23-35 - [c16]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
On the Usability of Probably Approximately Correct Implication Bases. ICFCA 2017: 72-88 - [c15]Franz Baader, Daniel Borchmann, Adrian Nuradiansyah:
The Identity Problem in Description Logic Ontologies and Its Application to View-Based Information Hiding. JIST 2017: 102-117 - [p1]Daniel Borchmann, Tom Hanika:
Individuality in Social Networks. Formal Concept Analysis of Social Networks 2017: 19-40 - [e1]Karell Bertet, Daniel Borchmann, Peggy Cellier, Sébastien Ferré:
Formal Concept Analysis - 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings. Lecture Notes in Computer Science 10308, Springer 2017, ISBN 978-3-319-59270-1 [contents] - [i4]Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
On the Usability of Probably Approximately Correct Implication Bases. CoRR abs/1701.00877 (2017) - 2016
- [j2]Daniel Borchmann, Felix Distel, Francesco Kriegel:
Axiomatisation of general concept inclusions from finite interpretations. J. Appl. Non Class. Logics 26(1): 1-46 (2016) - [c14]Daniel Borchmann, Tom Hanika:
Some Experimental Results on Randomly Generating Formal Contexts. CLA 2016: 57-69 - 2015
- [c13]Francesco Kriegel, Daniel Borchmann:
NextClosures: Parallel Computation of the Canonical Base. CLA 2015: 181-192 - [c12]Daniel Borchmann:
Exploring Faulty Data. ICFCA 2015: 219-235 - [i3]Daniel Borchmann, Bernhard Ganter:
Abstract Attribute Exploration with Partial Object Descriptions. CoRR abs/1511.06191 (2015) - 2014
- [b1]Daniel Borchmann:
Learning terminological knowledge with high confidence from erroneous data. Dresden University of Technology, 2014, pp. 1-204 - [j1]Uwe Ryssel, Felix Distel, Daniel Borchmann:
Fast algorithms for implication bases and attribute exploration using proper premises. Ann. Math. Artif. Intell. 70(1-2): 25-53 (2014) - [c11]Daniel Borchmann:
Learning Terminological Knowledge with High Confidence from Erroneous Data. Joint Workshop of the German Research Training Groups in Computer Science 2014: 138 - [c10]Josefine Asmus, Daniel Borchmann, Ivo F. Sbalzarini, Dirk Walther:
Towards an FCA-based Recommender System for Black-Box Optimization. FCA4AI@ECAI 2014: 35-42 - [c9]Johannes Wollbold, Rüdiger Köhling, Daniel Borchmann:
Attribute Exploration with Proper Premises and Incomplete Knowledge Applied to the Free Radical Theory of Ageing. ICFCA 2014: 268-283 - 2013
- [c8]Daniel Borchmann:
Axiomatizing Confident EL^bot_gfp-General Concept Inclusions in the Presence of Untrusted Individuals. Description Logics 2013: 65-79 - [c7]Daniel Borchmann:
Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis. ICFCA 2013: 60-75 - [c6]Daniel Borchmann:
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data. K-CAP 2013: 1-8 - [c5]Daniel Borchmann:
Experience Based Nonmonotonic Reasoning. LPNMR 2013: 200-205 - 2012
- [c4]Daniel Borchmann:
A Generalized Next-Closure Algorithm - Enumerating Semilattice Elements from a Generating Set. CLA 2012: 9-20 - [i2]Daniel Borchmann:
Deciding Entailment of Implications with Support and Confidence in Polynomial Space. CoRR abs/1201.5719 (2012) - [i1]Daniel Borchmann:
A General Form of Attribute Exploration. CoRR abs/1202.4824 (2012) - 2011
- [c3]Uwe Ryssel, Felix Distel, Daniel Borchmann:
Fast Computation of Proper Premises. CLA 2011: 100-113 - [c2]Daniel Borchmann, Felix Distel:
Mining of EL-GCIs. ICDM Workshops 2011: 1083-1090
2000 – 2009
- 2009
- [c1]Daniel Borchmann, Bernhard Ganter:
Concept Lattice Orbifolds - First Steps. ICFCA 2009: 22-37
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
