Boolean Substructures in Formal Concept Analysis

04/14/2021
by   Maren Koyda, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

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'...
research
03/06/2019

Incremental Computation of Concept Diagrams

Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) ...
research
12/20/2022

Factorizing Lattices by Interval Relations

This work investigates the factorization of finite lattices to implode s...
research
07/21/2023

Formal Concept Lattice Representations and Algorithms for Hypergraphs

There is increasing focus on analyzing data represented as hypergraphs, ...
research
02/14/2021

Finite Confluences and Closed Pattern Mining

The purpose of this article is to propose and investigate a partial orde...
research
08/02/2022

Interval-Dismantling for Lattices

Dismantling allows for the removal of elements of a set, or in our case ...
research
01/15/2012

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

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

Please sign up or login with your details

Forgot password? Click here to reset