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.
Semiring frameworks and algorithms for shortest-distance problems
3 Pith papers cite this work, alongside 256 external citations. Polarity classification is still indexing.
3
Pith papers citing it
256
external citations · Crossref
representative citing papers
A generic fixed-point algorithm, verified in Isabelle, decides minimal winning budgets for energy games over well-founded semilattices whose updates admit Galois adjoints, covering several known quantitative reachability problems.
citing papers explorer
-
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.
-
Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems
A generic fixed-point algorithm, verified in Isabelle, decides minimal winning budgets for energy games over well-founded semilattices whose updates admit Galois adjoints, covering several known quantitative reachability problems.
- The Role of Semirings in Incremental View Maintenance