Stem Base

Canonical minimal generating set for the implicational theory of a formal context; sound, complete, and of minimal cardinality.

Neighborhood — ranked by edge-count

method

Attribute Exploration
associated_withimplements
Interactive algorithm for discovering complete implicational knowledge by computing stem base and seeking counterexamples.

concept

Pseudo-Intent
associated_with
A set P that is not its own closure but contains closures of all proper pseudo-intent subsets; used to define stem base.
implication
associated_with
Implication A → B holds in a formal context iff every object that has all attributes in A also has all in B.

artifact

Finger Exercises in Formal Concept Analysis (2006 ICCL Summer School)
about
Slide deck tutorial on Formal Concept Analysis by Bernhard Ganter presented at Dresden ICCL Summer School, June/July 2006.

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.

The stem base is sound, complete, and of minimal cardinality.claim0.815
Claim about the properties of the stem base.
Stem base is sound, complete, and of minimal cardinality for implicational theory of a formal context.finding0.796
Its stem base consists of 88 implications.finding0.763
Number of implications in the full stem base of the trees context.
Base Capabilityconcept0.748
A model's task-solving capability without harness evolution, used as baseline for comparing evolution gains
Cross-base transferconcept0.742
Transfer of arithmetic rules from one numeral base to another after SFT.
Base-9 arithmeticconcept0.737
Low pretraining exposure numeral system used in E2.
Base (Palumbo)concept0.731
The base of the column, a center at the bottom.
Base-10 additionconcept0.730
The generic addition mechanism that Llama-3.1-8B actually uses to compute sums before mapping back to cyclic concept space