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

07/25/2019
by   Tsong-Ming Liaw, et al.
0

As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible construction that can be completed in a single scan of the formal context, though the conventional formal-concept lattice and rough-set lattice can be regained from the general concept lattice. The logic implication deducible from the general concept lattice takes the form of μ_1 →μ_2 where μ_1,μ_2 ∈ M^∗ are composite attributes out of the concerned formal attributes M. Remarkable is that with a single formula based on the contextual truth 1_η one can deduce all the implication relations extractable from the formal context. For concreteness, it can be shown that any implication A → B (A, B being subsets of the formal attributes M) discussed in the formal-concept lattice corresponds to a special case of μ_1 →μ_2 by means of μ_1 = ∏ A and μ_2 = ∏ B. Thus, one may elude the intractability due to searching for the Guigues-Duquenne basis appropriate for the implication relations deducible from the formal-concept lattice. Likewise, one may identify those μ_1 →μ_2 where μ_1 = ∑ A and μ_2 = ∑ B with the implications that can be acquired from the rough-set lattice. (Here, the product ∏ stands for the conjunction and the summation ∑ the disjunction.)

READ FULL TEXT
research
07/24/2019

A General Theory of Concept Lattice (I): Emergence of General Concept Lattice

As the first part of the treatise on A General Theory of Concept Lattice...
research
11/03/2018

The IFF Approach to the Lattice of Theories

The IFF approach for the notion of "lattice of theories" uses the idea o...
research
04/14/2021

Boolean Substructures in Formal Concept Analysis

It is known that a (concept) lattice contains an n-dimensional Boolean s...
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...
research
04/17/2023

Automatic Textual Explanations of Concept Lattices

Lattices and their order diagrams are an essential tool for communicatin...
research
07/11/2023

Mining for Unknown Unknowns

Unknown unknowns are future relevant contingencies that lack an ex ante ...

Please sign up or login with your details

Forgot password? Click here to reset