DeepAI AI Chat
Log In Sign Up

Boolean Substructures in Formal Concept Analysis

by   Maren Koyda, et al.

It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only if the context contains an n-dimensional contra-nominal scale as subcontext. In this work, we investigate more closely the interplay between the Boolean subcontexts of a given finite context and the Boolean suborders of its concept lattice. To this end, we define mappings from the set of subcontexts of a context to the set of suborders of its concept lattice and vice versa and study their structural properties. In addition, we introduce closed-subcontexts as an extension of closed relations to investigate the set of all sublattices of a given lattice.


page 1

page 2

page 3

page 4


A General Theory of Concept Lattice (II): Tractable Lattice Construction and Implication Extraction

As the second part of the treatise 'A General Theory of Concept Lattice'...

Incremental Computation of Concept Diagrams

Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) ...

Factorizing Lattices by Interval Relations

This work investigates the factorization of finite lattices to implode s...

Finite Confluences and Closed Pattern Mining

The purpose of this article is to propose and investigate a partial orde...

Interval-Dismantling for Lattices

Dismantling allows for the removal of elements of a set, or in our case ...

Tacit knowledge mining algorithm based on linguistic truth-valued concept lattice

This paper is the continuation of our research work about linguistic tru...

Lattices and Their Consistent Quantification

This paper introduces the order-theoretic concept of lattices along with...