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.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
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.
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.
-
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.
-
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.