Temporalization of Probabilistic Propositional Logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2087806 (Why is no real title available?)
- A logic for reasoning about probabilities
- A probabilistic PDL
- Algorithms in real algebraic geometry
- Exogeneous semantics approach to enriching logics
- Reasoning about probabilistic sequential programs
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Symbolic model checking for probabilistic processes
- The complexity of propositional linear temporal logics
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
- Weakly complete axiomatization of exogenous quantum propositional logic
Cited in
(7)- scientific article; zbMATH DE number 7319046 (Why is no real title available?)
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Probabilization of logics: completeness and decidability
- Annotated probabilistic temporal logic
- Super-Solutions
- Exogenous probabilistic computation tree logic
- Annotated probabilistic temporal logic: approximate fixpoint implementation
This page was built for publication: Temporalization of Probabilistic Propositional Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605519)