Formal contexts are used to represent objects as attribute sets. Incomplete contexts may be used to describe situations when it is not known whether an object has a particular attribute. In thisâ€¦ (More)

In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by theâ€¦ (More)

We investigate possible improvements to the existing algorithm for classifying EL TBoxes. We present a modified algorithm based on the well-known linear closure algorithm from relational databases.â€¦ (More)

Although the notion of a concept as a collection of objects sharing certain properties, and the notion of a conceptual hierarchy are fundamental to both Formal Concept Analysis and Descriptionâ€¦ (More)

Although the notion of a concept as a collection of objects sharing certain properties, and the notion of a conceptual hierarchy are fundamental to both Formal Concept Analysis and Descriptionâ€¦ (More)

We intoduce the ELepHant reasoner, a consequence-based reasoner for the EL fragment of DLs. We present optimizations, implementation details and experimental results for classification of severalâ€¦ (More)

Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. Inâ€¦ (More)

We investigate whether the pseudo-intents of a given formal context can efficiently be enumerated. We show that they cannot be enumerated in a specified lexicographic order with polynomial delayâ€¦ (More)