The Graph Disagrees With Itself
A knowledge graph that can't disagree with itself isn't a knowledge graph. It's a position paper with footnotes — and it dies the moment one node turns out to be wrong.
Most knowledge bases enforce consistency. Two nodes that contradict each other are flagged as a bug. Editorial process resolves the disagreement, picks a side, and the graph returns to a state in which everything agrees with everything else.
This is the wrong design for knowledge that is still being built.
A real corpus that has been written over time contains contradictions, because the author's understanding has changed, because different parts of the same domain pull against each other, because the right answer in one context is wrong in another. Erasing the contradictions does not produce a more accurate corpus; it produces a flat one that has lost the structure where the interesting questions live.
The alternative is to let the graph contain its own disagreements, mark them explicitly as edges of a different type, and treat the disagreement as a piece of structure rather than a defect to repair. Two nodes that contradict each other plus an edge that names the contradiction is more informative than either node alone. The reader can see the seam, walk both sides, and form their own view of which side held.
This is harder than enforcing consistency. It requires the writer to keep track of where their own positions have moved, to write nodes that point at superseded ones rather than overwriting them, and to resist the urge to clean up. The payoff is that the graph is honest about being a record of a thinker, not a finished encyclopedia. The reader who finds a contradiction has not found a bug; they have found exactly the spot where the writer is still working.