Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
From MaRDI portal
(Redirected from Publication:5477458)
Recommendations
Cited in
(22)- Probabilistic logic with independence
- Introduction: Combining probability and logic
- Probabilistic temporal logic with countably additive semantics
- A survey on temporal logics for specifying and verifying real-time systems
- Probabilistic temporal reasoning using superposition semantics
- Probability logics for reasoning about quantum observations
- Probabilization of logics: completeness and decidability
- Decidability of finite probabilistic propositional dynamic logics
- Reasoning about group responsibility for exceeding risk threshold in one-shot games
- Complexity Results for Probabilistic Datalog
- \textsf{PFL}: a probabilistic logic for fault trees
- A propositional linear time logic with time flow isomorphic to ^2
- Logics with Probability Operators
- Hierarchies of probabilistic logics
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- No finite model property for logics of quantified announcements
- A decidable probability logic for timed probabilistic systems
- scientific article; zbMATH DE number 3869302 (Why is no real title available?)
- scientific article; zbMATH DE number 1929309 (Why is no real title available?)
- Probabilistic propositional temporal logics
- Probabilistic logic over paths
- Probabilistic Temporal Logics
This page was built for publication: Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477458)