Computer Science – Logic in Computer Science
Scientific paper
2004-10-25
Fundam. Inform. 74:2-3 (2006) 301-328
Computer Science
Logic in Computer Science
36 pages
Scientific paper
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched with notions such as approximation by computation or representability. The latter are commonly studied in denotational semantics and domain theory and captured most prominently by the notion of algebraicity, e.g. of lattices. In this paper, we explore the notion of algebraicity in formal concept analysis from a category-theoretical perspective. To this end, we build on the the notion of approximable concept with a suitable category and show that the latter is equivalent to the category of algebraic lattices. At the same time, the paper provides a relatively comprehensive account of the representation theory of algebraic lattices in the framework of Stone duality, relating well-known structures such as Scott information systems with further formalisms from logic, topology, domains and lattice theory.
Hitzler Pascal
Krötzsch Markus
Zhang Guo-Qiang
No associations
LandOfFree
A Categorical View on Algebraic Lattices in Formal Concept Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Categorical View on Algebraic Lattices in Formal Concept Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Categorical View on Algebraic Lattices in Formal Concept Analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-477269