1167 search results - page 83 / 234 » A Really Temporal Logic |
AIML
2006
13 years 11 months ago
2006
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the `sharing of idea...
DLT
2004
13 years 11 months ago
2004
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...
ENTCS
2010
13 years 9 months ago
2010
We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure `a la Wolper for testing satisfiability in the linear time temporal ...
EMISA
2002
Springer
13 years 9 months ago
2002
Springer
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...