Temporalization of Probabilistic Propositional Logic

DOI10.1007/978-3-540-92687-0_4zbMath1211.03042OpenAlexW2150027928WikidataQ59196675 ScholiaQ59196675MaRDI QIDQ3605519

Pedro Baltazar, Paulo Mateus

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92687-0_4

Mathematics Subject Classification ID

Probability and inductive logic (03B48)

Related Items (2)

Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains ⋮ Probabilization of logics: completeness and decidability

Uses Software

• PRISM
• SatAbs

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic PDL
• A logic for reasoning about probabilities
• Reasoning about probabilistic sequential programs
• Weakly complete axiomatization of exogenous quantum propositional logic
• The complexity of propositional linear temporal logics
• Symbolic model checking for probabilistic processes
• Theory and Applications of Satisfiability Testing
• Tools and Algorithms for the Construction and Analysis of Systems
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Algorithms in real algebraic geometry

This page was built for publication: Temporalization of Probabilistic Propositional Logic