Introduces token-sensitive enclosure semantics where each measurement carries an interval and an observation token, defining warranted enclosures as sets of consistent values, with proofs that token-erased summaries cannot recover correct rewrite classes, all mechanized in Lean 4.
In Database Theory — ICDT 2001 , Jan Van den Bussche and Victor Vianu (Eds.)
4 Pith papers cite this work, alongside 1,310 external citations. Polarity classification is still indexing.
4
Pith papers citing it
1,310
external citations · OpenAlex
years
2026 4representative citing papers
Determination provenance models tuple supports as elements of a commutative semiring under layered resolutions, inducing a filtration that positive relational algebra respects and that unifies isolation levels with negation semantics.
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.
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.
citing papers explorer
-
Token-Sensitive Enclosure Semantics for Measurement-Bearing Expressions
Introduces token-sensitive enclosure semantics where each measurement carries an interval and an observation token, defining warranted enclosures as sets of consistent values, with proofs that token-erased summaries cannot recover correct rewrite classes, all mechanized in Lean 4.
-
Determination Provenance: From Ambiguity to Algebra
Determination provenance models tuple supports as elements of a commutative semiring under layered resolutions, inducing a filtration that positive relational algebra respects and that unifies isolation levels with negation semantics.
-
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.
-
Geo: A Query Rewrite Framework for Graph Pattern Mining
Geo is a framework for optimizing graph pattern matching queries via rewrite rules and equality saturation that discovers equivalences and reduces costs by up to 99%.