• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 2020
• 
  Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
  Probably approximately correct learning of Horn envelopes from queries. Discret. Appl. Math. 273: 30-42 (2020)
• 2018
• 
  Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
  Probably approximately correct learning of Horn envelopes from queries. CoRR abs/1807.06149 (2018)
• 2017
• 
  Francesco Kriegel, Daniel Borchmann:
  NextClosures: parallel computation of the canonical base with background knowledge. Int. J. Gen. Syst. 46(5): 490-510 (2017)
• 
  Franz Baader, Daniel Borchmann, Adrian Nuradiansyah:
  Preliminary Results on the Identity Problem in Description Logic Ontologies. Description Logics 2017
• 
  Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
  On the Usability of Probably Approximately Correct Implication Bases. ICFCA 2017: 72-88
• 
  Bernhard Ganter, Rudolf Wille, Daniel Borchmann, Juliane Prochaska:
  Implications and Dependencies Between Attributes. ICFCA 2017: 23-35
• 
  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
• 
  Daniel Borchmann, Tom Hanika:
  Individuality in Social Networks. Formal Concept Analysis of Social Networks 2017: 19-40
• 
  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]
• 
  Daniel Borchmann, Tom Hanika, Sergei Obiedkov:
  On the Usability of Probably Approximately Correct Implication Bases. CoRR abs/1701.00877 (2017)
• 2016
• 
  Daniel Borchmann, Felix Distel, Francesco Kriegel:
  Axiomatisation of general concept inclusions from finite interpretations. J. Appl. Non Class. Logics 26(1): 1-46 (2016)
• 
  Daniel Borchmann, Tom Hanika:
  Some Experimental Results on Randomly Generating Formal Contexts. CLA 2016: 57-69
• 2015
• 
  Francesco Kriegel, Daniel Borchmann:
  NextClosures: Parallel Computation of the Canonical Base. CLA 2015: 181-192
• 
  Daniel Borchmann:
  Exploring Faulty Data. ICFCA 2015: 219-235
• 
  Daniel Borchmann, Bernhard Ganter:
  Abstract Attribute Exploration with Partial Object Descriptions. CoRR abs/1511.06191 (2015)
• 2014
• 
  Daniel Borchmann:
  Learning terminological knowledge with high confidence from erroneous data. Dresden University of Technology, 2014, pp. 1-204
• 
  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)
• 
  Daniel Borchmann:
  Learning Terminological Knowledge with High Confidence from Erroneous Data. Joint Workshop of the German Research Training Groups in Computer Science 2014: 138
• 
  Josefine Asmus, Daniel Borchmann, Ivo F. Sbalzarini, Dirk Walther:
  Towards an FCA-based Recommender System for Black-Box Optimization. FCA4AI@ECAI 2014: 35-42
• 
  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
• 
  Daniel Borchmann:
  Axiomatizing Confident ELbot_gfp-General Concept Inclusions in the Presence of Untrusted Individuals. Description Logics 2013: 65-79
• 
  Daniel Borchmann:
  Towards an Error-Tolerant Construction of $\mathcal{EL}\bot$ -Ontologies from Data Using Formal Concept Analysis. ICFCA 2013: 60-75
• 
  Daniel Borchmann:
  Axiomatizing εL⊥-expressible terminological knowledge from erroneous data. K-CAP 2013: 1-8
• 
  Daniel Borchmann:
  Experience Based Nonmonotonic Reasoning. LPNMR 2013: 200-205
• 2012
• 
  Daniel Borchmann:
  A Generalized Next-Closure Algorithm - Enumerating Semilattice Elements from a Generating Set. CLA 2012: 9-20
• 
  Daniel Borchmann:
  Deciding Entailment of Implications with Support and Confidence in Polynomial Space. CoRR abs/1201.5719 (2012)
• 
  Daniel Borchmann:
  A General Form of Attribute Exploration. CoRR abs/1202.4824 (2012)
• 2011
• 
  Uwe Ryssel, Felix Distel, Daniel Borchmann:
  Fast Computation of Proper Premises. CLA 2011: 100-113
• 
  Daniel Borchmann, Felix Distel:
  Mining of EL-GCIs. ICDM Workshops 2011: 1083-1090
• 2009
• 
  Daniel Borchmann, Bernhard Ganter:
  Concept Lattice Orbifolds - First Steps. ICFCA 2009: 22-37