.png){kind=icon}
.png){kind=icon}
Return
Factorizing lattices by interval relations
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2023.03.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this purpose and answer the question of finding the finest of those relations to implode a given interval in the generated factor lattice. To overcome the limitations of the factorization based on those relations, we introduce a new lattice factorization that enables the imploding of selected disjoint intervals of a finite lattice. To this end, we propose an interval relation that generates this factorization. To obtain lattices rather than arbitrary ordered sets, we restrict this approach to so-called pure intervals. For our study, we will make use of methods from Formal Concept Analysis (FCA). We will also provide a new FCA construction by introducing the enrichment of an incidence relation by a set of intervals in a formal context, to investigate the approach for lattice-generating interval relations on the context side.(c) 2023 Published by Elsevier Inc.
Keywords:
Formal concept analysis
Lattices
Intervals
Factorization
Order
Crowns
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K