Pages that link to "Item:Q5477458"
From MaRDI portal
The following pages link to Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity (Q5477458):
Displaying 15 items.
- Hierarchies of probabilistic logics (Q465583) (← links)
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- A propositional probabilistic logic with discrete linear time for reasoning about evidence (Q1928821) (← links)
- Probabilization of logics: completeness and decidability (Q2254552) (← links)
- Probabilistic logic with independence (Q2379311) (← links)
- Introduction: Combining probability and logic (Q2390649) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- Complexity Results for Probabilistic Datalog (Q4576254) (← links)
- Logics with Probability Operators (Q5024712) (← links)
- Probabilistic Temporal Logics (Q5024714) (← links)
- Probabilistic Logic over Paths (Q5415665) (← links)
- Probability logics for reasoning about quantum observations (Q6113689) (← links)
- Probabilistic temporal logic with countably additive semantics (Q6560997) (← links)
- No finite model property for logics of quantified announcements (Q6642571) (← links)