2573 search results - page 72 / 515 » Combinations of Modal Logics |
132
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
125
Voted
ATVA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
116
Voted
TABLEAUX
1998
Springer
15 years 8 months ago
1998
Springer
This paper is concerned with various schemes for enhancing the performance of modal tableau procedures. It discusses techniques and strategies for dealing with the nondeterminism i...
148
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
125
click to vote
AUSAI
2003
Springer
15 years 9 months ago
2003
Springer
Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [...