169 search results - page 4 / 34 » Temporalization of Probabilistic Propositional Logic |
126
click to vote
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
REX
1989
15 years 4 months ago
1989
In this paper we further develop the methodology of temporal logic as an executable imperative language, presented by Moszkowski [Mos86] and Gabbay [Gab87, Gab89] and present a con...
119
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
103
Voted
SEFM
2009
IEEE
15 years 7 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
CSL
2009
Springer
15 years 7 months ago
2009
Springer
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of te...