Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

LFCS
2009
Springer

favoriteEmaildiscussreport

224views Artificial Intelligence» more LFCS 2009»

Temporalization of Probabilistic Propositional Logic

13 years 11 months ago

Temporalization of Probabilistic Propositional Logic

Download wslc.math.ist.utl.pt

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.

Pedro Baltazar, Paulo Mateus

Real-time Traffic

Artificial Intelligence | Exogenous Probabilistic Linear | LFCS 2009 | Probabilistic Propositional Logic | Temporal Logic |

claim paper

Related Content

» Exogenous Probabilistic Computation Tree Logic

» Probabilistic logic with independence

» Using Temporal Logic for Spatial Reasoning Temporalized Propositional Neighborhood Logic

» Propositional Interval Temporal Logics Some Promising Paths

» A Hierarchical Completeness Proof for Propositional Temporal Logic

» Automated Natural Deduction for Propositional LinearTime Temporal Logic

» A Markov Reward Model for Software Reliability

» An Aprioribased Approach for FirstOrder Temporal Pattern Mining

» On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	LFCS
Authors	Pedro Baltazar, Paulo Mateus

Comments (0)