# Search results for: Léonard Kwuida

Lecture Notes in Computer Science > Conceptual Structures at Work > Concept Lattices and Concept Graphs > 227-241

*Formal Concept Analysis*. Boole (1815-1864) developed a mathematical theory for human thought based on signs and classes. The formalization of the negation of concepts is needed in order to develop a mathematical theory of...

Lecture Notes in Computer Science > Concept Lattices > 142-155

*P*, ≤ ) is the smallest (up to isomorphism) complete poset containing (

*P*, ≤ ) that preserves existing joins and existing meets. It is wellknown that the MacNeille completion of a Boolean algebra is a Boolean algebra. It is also wellknown that the MacNeille completion of a distributive lattice is not always a distributive lattice (see [Fu44]). The MacNeille completion...

**AMS Subject Classification:**06D15,...

*n*-ary relations are commonly found in real-life applications and data collections. In this paper, we define new notions and propose procedures to mine closed tri-sets (triadic concepts) and triadic association rules within the framework of triadic concept analysis. The input data is represented as a formal triadic context of the form $\mathbb{K}:=(K_1, K_2, K_3, Y)$...

Lecture Notes in Computer Science

Annals of Mathematics and Artificial Intelligence > 2014 > 72 > 1-2 > 151-168

*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...

Discrete Applied Mathematics > 2011 > 159 > 10 > 990-1001

*k*labels (

*k*-posets) and their homomorphisms are examined. We give a representation of directed graphs by

*k*-posets; this provides a new proof of the universality of the homomorphism order of

*k*-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima,...

Annals of Mathematics and Artificial Intelligence > 2010 > 59 > 2 > 223-239

*concepts*. They have been introduced to capture the equational theory of concept algebras (Wille 2000; Kwuida 2004). They generalize Boolean algebras. Concept algebras are concept lattices, thus complete lattices, with a weak negation and a weak opposition. A special case of the representation...

Discussiones Mathematicae - General Algebra and Applications > 2007 > 27 > 2 > 263-275

*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.