Develops a probabilistic epistemic logic framework for bounded-round randomized distributed algorithms and applies it to formally analyze and strengthen the lower bound of the Varghese-Lynch randomized coordinated attack algorithm.
A Simplicial Model for KB4: Epistemic Logic with Agents That May Die
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces DSL and DDSL as deontic logics on simplicial complexes for modeling joint commitments, with claimed soundness and completeness proofs.
citing papers explorer
-
A Dynamic Deontic Simplicial Logic for Joint Commitments
Introduces DSL and DDSL as deontic logics on simplicial complexes for modeling joint commitments, with claimed soundness and completeness proofs.