Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Non-deterministic information systems and their domains
Theoretical Computer Science
Logic of domains
Handbook of logic in computer science (vol. 1)
Handbook of logic in computer science (vol. 3)
Elementary categories, elementary toposes
Elementary categories, elementary toposes
Clausal logic and logic programming in algebraic domains
Information and Computation
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis on Its Way from Mathematics to Computer Science
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Disjunctive Systems and L-Domains
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Sequents, Frames, and Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Theoretical Computer Science
Multi Lingual Sequent Calculus and Coherent Spaces
Fundamenta Informaticae
Topology And The Semantics Of Logic Programs
Fundamenta Informaticae
Categories of algebraic contexts equivalent to idempotent semirings and domain semirings
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Formal concept analysis based on the topology for attributes of a formal context
Information Sciences: an International Journal
Formal query systems on contexts and a representation of algebraic lattices
Information Sciences: an International Journal
A categorical representation of algebraic domains based on variations of rough approximable concepts
International Journal of Approximate Reasoning
Hi-index | 0.00 |
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 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.