148 search results - page 1 / 30 » On the Complexity of Elementary Modal Logics |
CORR
2008
Springer
13 years 5 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...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
TCS
2011
12 years 11 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
CCIA
2007
Springer
13 years 11 months ago
2007
Springer
We introduce Multimodal Logics of Normative Systems as a contribution to the development of a general logical framework for reasoning about normative systems over logics for Multi-...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Modal dependence logic was introduced very recently by V