Formal Concept Analysis

Concepts (19)

• Next Closure AlgorithmEfficient algorithm for computing all closed sets (intents or extents) in lectic order without storing exponential lists.
• Robin MilnerOriginator of Process Algebra and the term 'Information Dynamics'; influential in shifting focus from syntax-driven semantics to autonomous study of informatic structures.
• Concept LatticeCentral algebraic structure in FCA that orders formal concepts and preserves information from formal contexts.
• Hilary A. PriestleyAuthor of the primer on ordered sets and complete lattices for computer science.
• Abramsky & JungAuthors cited for sophisticated development of domain theory and CPO theory in semantic domains.
• Bernhard GanterAuthor and primary expositor of Formal Concept Analysis methods in this pedagogical paper.
• Coalgebra
• CSP (Communicating Sequential Processes)The language fragment underlying Occam; cited in message-passing discussion.
• Geometry of InteractionDynamic model connecting logic to geometry through explicit treatment of information flow and interaction; demonstrates emergent logical complexity from simple copy-cat processes.
• Gierz et al.Authors of foundational text on CPOs and ordered structures; referenced for theory developed since 1970s.
• Operational PrincipleTechnique for describing a concept through an archetypal scenario that explains how the concept fulfills its purpose
• Rudolf Wille
• TOSCANA
• Closure OperatorsOperators X → X'' on subsets of objects or attributes, satisfying extensivity, monotonicity and idempotence.
• Complete Lattice
• Concepts in Software Design
• CPO (Complete Partial Order)
• Galois Connection
• Jan Rutten