711 search results - page 70 / 143 » Modal Logics are Coalgebraic |
ATVA
2010
Springer
14 years 11 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...
91
Voted
STACS
2007
Springer
15 years 4 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...
84
Voted
AUSAI
2003
Springer
15 years 3 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 [...
96
Voted
MLQ
2000
14 years 10 months ago
2000
: Each information system (or data table) leads to a hierarchy of binary relations on the object set in a natural way; these relational systems can serve as frames for the semantic...
68
Voted
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem...