Abstract
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a temporal version - Exogenous Probabilistic Linear Temporal Logic (EPLTL). In detail, we give a small model theorem for EPPL and introduce a satisfaction and a model checking algorithm for both EPPL and EPLTL. We are also able to provide a (weakly) complete calculus for EPLTL. Finally, we conclude by pointing out some future work. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Baltazar, P., & Mateus, P. (2009). Temporalization of probabilistic propositional logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5407 LNCS, pp. 46–60). https://doi.org/10.1007/978-3-540-92687-0_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
