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.
Provenance semirings
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 8roles
background 2polarities
background 2representative 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.
Preservation theorems hold for all lattice semirings but fail for tropical, Viterbi, Łukasiewicz, and natural semirings, while existential preservation holds on finite interpretations for lattices unlike the Boolean case.
MemoRepair formalizes the cascade update problem in agentic memory and solves it via a min-cut reduction that eliminates invalidated memory exposure to 0% while recovering 91-94% of valid successors at 57-76% of baseline repair cost.
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.
The paper develops semiring-annotated topological spaces (seats) extending epistemic logic to model resource costs for observing evidence, with sound and strongly complete axiomatizations for resource-indexed modalities.
Weighted NetKAT extends NetKAT with semiring weights and weighted NetKAT automata to enable automatic verification of quantitative safety and reachability properties.
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.
-
Preservation Theorems in Semiring Semantics
Preservation theorems hold for all lattice semirings but fail for tropical, Viterbi, Łukasiewicz, and natural semirings, while existential preservation holds on finite interpretations for lattices unlike the Boolean case.
-
MEMOREPAIR: Barrier-First Cascade Repair in Agentic Memory
MemoRepair formalizes the cascade update problem in agentic memory and solves it via a min-cut reduction that eliminates invalidated memory exposure to 0% while recovering 91-94% of valid successors at 57-76% of baseline repair cost.
-
Polymorphic Bottom-Up Weighted Relational Programming
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.
-
Knowledge on a Budget
The paper develops semiring-annotated topological spaces (seats) extending epistemic logic to model resource costs for observing evidence, with sound and strongly complete axiomatizations for resource-indexed modalities.
-
Weighted NetKAT: A Programming Language For Quantitative Network Verification
Weighted NetKAT extends NetKAT with semiring weights and weighted NetKAT automata to enable automatic verification of quantitative safety and reachability properties.