刊物主题:Artificial Intelligence and Robotics Computer Communication Networks Software Engineering Data Encryption Database Management Computation by Abstract Devices Algorithm Analysis and Problem Complexity
出版者:Springer Berlin / Heidelberg
ISSN:1611-3349
文摘
Formal concepts and concept lattices are two central notions of formal concept analysis. This paper investigates the problem of determining formal concepts based on the congruences on semilattices. The properties of congruences corresponding to formal contexts are discussed. The relationship between the closed sets generated by congruences and the elements of indiscernibility matrices is examined. Consequently, a new approach of determining concept lattices is derived.