Incremental Computation of Concept Diagrams
classification
💻 cs.LO
keywords
conceptincrementalalgorithmalreadyattributeattribute-additivecolumncomputation
read the original abstract
Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) with an attribute-additive concept diagram is already known, and an attribute column C=(G,{n},J) shall be inserted to or removed from it. This paper introduces and proves an incremental update algorithm for both tasks.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.