Lattice as Algebraic Structure

Poset with join and meet operations satisfying associativity, commutativity, idempotency, and absorption laws.

Neighborhood — ranked by edge-count

concept

Join and Meet Operations
cites
Binary operations in lattices; join (∨) gives supremum, meet (∧) gives infimum.

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Architecture as structure (computing)concept0.806
The definition of 'architecture' in computing as the structural design of systems, dating to 1960s mainframes, central to information architecture.
Concept Latticeconcept0.799
Central algebraic structure in FCA that orders formal concepts and preserves information from formal contexts.
Structure in computationconcept0.791
The actual computational operations a model performs, which the paper argues need not mirror representational structure
Complete Latticeconcept0.780
Algebraic Structure Theory of Sequential Machinesframework0.775
Hartmanis & Stearns framework for machine behavior; relevant to formalizing regulators as input-output systems.
Concept Lattice (Formal Concept Analysis)framework0.772
Theory developed by R. Wille and TH Darmstadt group; reveals hierarchical structure in binary relations through lattices of formal concepts.
process latticeconcept0.771
Hierarchical structure of concurrent expert processes envisioned for real-time monitoring applications.
Is there a concept lattice?question0.768
Question posed for the driving test many-valued context.