Skip to main content
Conference Proceedings

On links between concept lattices and related complexity problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5986 LNAI 138-144
DOI: 10.1007/978-3-642-11928-6_10
4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Babin, M. A., & Kuznetsov, S. O. (2010). On links between concept lattices and related complexity problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5986 LNAI, pp. 138–144). https://doi.org/10.1007/978-3-642-11928-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free