169 search results - page 15 / 34 » Temporalization of Probabilistic Propositional Logic |
117
click to vote
FOSSACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
100
Voted
KBSE
2005
IEEE
15 years 6 months ago
2005
IEEE
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
107
click to vote
DLT
2009
14 years 10 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
101
click to vote
ENTCS
2007
15 years 11 days ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
100
Voted
CADE
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...