132 search results - page 6 / 27 » Lower bounds for modal logics |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
89
Voted
TACAS
2010
Springer
15 years 5 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
98
Voted
EUSFLAT
2007
14 years 11 months ago
2007
In this work we propose a general approach for representing uncertainty measures in the framework of t-norm based logics. This approach is extended also to classes of measures lik...
TCS
2002
14 years 10 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
Logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the be...