|
Sibirskii Matematicheskii Zhurnal, 2007, Volume 48, Number 5, Pages 1083–1092
(Mi smj1791)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
On computable formal concepts in computable formal contexts
A. S. Morozova, M. A. L'vovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
b Novosibirsk State University
Abstract:
We introduce and study the notions of computable formal context and computable formal concept. We give some examples of computable formal contexts in which the computable formal concepts fail to form a lattice and study the complexity aspects of formal concepts in computable contexts. In particular, we give some sufficient conditions under which the computability or noncomputability of a formal concept could be recognized from its lattice-theoretic properties. We prove the density theorem showing that in a Cantor-like topology every formal concept can be approximated by computable ones. We also show that not all formal concepts have lattice-theoretic approximations as suprema or infima of families of computable formal concepts.
Keywords:
formal concept analysis, computable formal context, computable concept, computable model.
Received: 26.04.2006
Citation:
A. S. Morozov, M. A. L'vova, “On computable formal concepts in computable formal contexts”, Sibirsk. Mat. Zh., 48:5 (2007), 1083–1092; Siberian Math. J., 48:5 (2007), 871–878
Linking options:
https://www.mathnet.ru/eng/smj1791 https://www.mathnet.ru/eng/smj/v48/i5/p1083
|
|