LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
Journal of philosophical logic 27(3), pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.LO 3years
2026 3verdicts
UNVERDICTED 3roles
background 2polarities
background 2representative citing papers
Introduces direct belief contraction on unconstrained Kripke models in DEL, shows it satisfies some but not all contraction properties, and gives sound complete axiomatizations for the logic and its extension to private announcements.
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.
citing papers explorer
-
Deciding the Common Fragment of CTL with Past and LTL
LTL ∩ PCTL is decidable because an LTL formula defines a PCTL-expressible tree language iff its word language is DBW-recognizable, via a new HWTcf automata characterization of PCTL.
-
Belief Contraction in Dynamic Epistemic Logic
Introduces direct belief contraction on unconstrained Kripke models in DEL, shows it satisfies some but not all contraction properties, and gives sound complete axiomatizations for the logic and its extension to private announcements.
-
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.