On links between concept lattices and related complexity problems

Authors:
Mikhail A. Babin;Sergei O. Kuznetsov
Affiliations:
State University Higher School of Economics, Moscow, Russia;State University Higher School of Economics, Moscow, Russia
Venue:
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Year:
2010

Citing 6
Cited 0

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Conceptual Structures of Multicontexts

ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Reducing the Representation Complexity of Lattice-Based Taxonomies

ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Lattices of rough set abstractions as P-products

ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
The tensor product as a lattice of regular galois connections

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several notions of links between contexts – intensionally related concepts, shared intents, and bonds, as well as interrelations thereof – are considered. Algorithmic complexity of the problems related to respective closure operators are studied. The expression of bonds in terms of shared intents is given.