148 search results - page 14 / 30 » On the Complexity of Elementary Modal Logics |
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
100
click to vote
AIML
2008
15 years 1 months ago
2008
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
ITA
2007
14 years 11 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
JAPLL
2010
14 years 6 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
AML
2007
14 years 12 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...