TOKI types four common contradiction-resolution heuristics as bitemporal operators on a dual-row schema, supplies soundness theorems, and shows via a verdict matrix that it alone avoids three write-time anomalies while retaining a language-model judge.
General- izedisolationleveldefinitions.InProceedingsofthe16th International Conference on Data Engineering (ICDE), pages 67–78, 2000
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DB 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.
citing papers explorer
-
TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory
TOKI types four common contradiction-resolution heuristics as bitemporal operators on a dual-row schema, supplies soundness theorems, and shows via a verdict matrix that it alone avoids three write-time anomalies while retaining a language-model judge.
-
A Theoretical Study of DBLog: Certified Virtual Cuts for a Snapshot-Equivalent Replay of Live Databases
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.