Formal Concept AllalY. 5is is a field of applied mathematics based on the math ematization
of concept and conceptual hierarchy. It thereby activates math ematical thinking for …

Dieses erste Lehrbuch zur Formalen Begriffsanalyse gibt eine systematische Darstellung
der mathematischen Grundlagen und ihrer Verbindung zu Anwendungen in der Informatik …

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 …

The joy of implications, aka pure Horn formulas: Mainly a survey - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

In rough set theory (RST), the notion of decision table plays a fundamental role. In this
paper, we develop a purely mathematical investigation of this notion to show that several …

A convex geometry is finite zero-closed closure system that satisfies the anti-exchange
property. Complexity results are given for two open problems related to representations of …

We present results inspired by the study of closure systems with unique critical sets. Many of
these results, however, are of a more general nature. Among those is the statement that …

In this paper we consider k-meet-semidistributive lattices and we are interested in the
computation of the set-colored poset associated to an implicational base. The parameter k is …

It is well known that every closure system can be represented by an implicational base, or by
the set of its meet-irreducible elements. In Horn logic, these are respectively known as the …

When is a finite modular lattice cover preserving embeddable into a partition lattice? We
give some necessary, and slightly sharper sufficient conditions. For example, the class of …