NextClosures: parallel computation of the canonical base with background knowledge

  title={NextClosures: parallel computation of the canonical base with background knowledge},
  author={Francesco Kriegel and Daniel Borchmann},
  journal={International Journal of General Systems},
  pages={490 - 510}
Abstract The canonical base of a formal context plays a distinguished role in Formal Concept Analysis, as it is the only minimal implicational base known so far that can be described explicitly. Consequently, several algorithms for the computation of this base have been proposed. However, all those algorithms work sequentially by computing only one pseudo-intent at a time – a fact that heavily impairs the practicability in real-world applications. In this paper, we shall introduce an approach… 

Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic

An application to inductive learning in a Horn description logic is proposed, that is, a procedure for sound and complete axiomatization of concept inclusions from a given interpretation and a complexity analysis shows that this procedure runs in deterministic exponential time.

Formal Concept Analysis

  • Cristea
  • Education
    Lecture Notes in Computer Science
  • 2019

Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)

An approach for generating proofs for expressive DLs based on a non-standard reasoning task called forgetting is developed and implemented and compared the obtained proofs with proofs generated by the DL reasoner ELK, finding that forgetting-based proofs are often better w.r.t. different measures of proof complexity.



NextClosures: Parallel Computation of the Canonical Base

This paper shall introduce an approach that remedies this deficit by allowing the canonical base to be computed in a parallel manner, and shows that for sufficiently large data-sets the speedup is proportional to the number of available CPUs.

Axiomatisation of general concept inclusions from finite interpretations

This work investigates in this work an approach which shall allow us to extract terminological knowledge in the form of general concept inclusions from factual data, where the data is given in the forms of vertex- and edge-labelled graphs.

An Approach to Exploring Description Logic Knowledge Bases

This paper shows how this formalism can be modified such that counterexamples to GCIs can be provided in the form of ABox-individuals and which description logics can be used for this ABox.

Parallel Attribute Exploration

An algorithm is presented that allows for Parallel Attribute Exploration and the integration of expert interaction for Attribute exploration in order to explore implicational bases of inaccessible formal contexts.

Fast Concept Analysis

An efficient algorithm for concept analysis that computes concepts together with their explicit lattice structure that increases quadratically with the number of concepts, but with a small quadratic component.

Formal Concept Analysis with Constraints by Closure Operators

The paper presents a general method of imposing constraints in formal concept analysis of tabular data describing objects and their attributes to filter-out outputs of the analysis which are not compatible with the constraint, in a computationally efficient way.

On the complexity of enumerating pseudo-intents

Axiomatization of General Concept Inclusions from Streams of Interpretations with Optional Error Tolerance

Applications that utilize the infimum and the supremum of closure operators that are induced by structures occuring in the field of Description Logics, including GCIs from streams of interpretations, are proposed.

Conceptual Exploration

This is the first textbook on attribute exploration, its theory, its algorithms for applications, and some of its many possible generalizations, which provides an introduction to Formal Concept Analysis with emphasis on its ability to derive algebraic structures from qualitative data.