No abstract

In this paper, we show how the existence of taxonomies on objects and/or attributes can be used in Formal Concept Analysis to help discover generalized concepts.To that end, we analyze three generalization cases (∃, ∀, and α) and present different scenarios of a simultaneous generalization on both objects and attributes. We also discuss the cardinality of the generalized pattern set against the number of simple patterns produced from the initial data set.

No abstract

Double Boolean algebras are algebras (D, , , , , ⊥, ) of type (2, 2, 1, 1, 0, 0). They have been introduced to capture the equational theory of the algebra of protoconcepts. A filter (resp. an ideal) of a double Boolean algebra D is an upper set F (resp. down set I) closed under (resp. ). A filter F is called primary if F = ∅ and for all x ∈ D we have x ∈ F or x ∈ F . In this note we prove that if F is a filter and I an ideal such that F ∩ I = ∅ then there is a primary filter G containing F such that G ∩ I = ∅ (i.e. the Prime Ideal Theorem for double Boolean algebras).

Concept algebras are concept lattices enriched by a weak negation and a weak opposition. In Ganter and Kwuida (Contrib. Gen. Algebra, 14:63-72, 2004) we gave a contextual description of the lattice of weak negations on a finite lattice. In this contribution 1 we use this description to give a characterization of finite distributive concept algebras.