Sciweavers

291 search results - page 3 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
ICALP
2010
Springer
13 years 4 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala
LICS
1994
IEEE
13 years 10 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
LOGCOM
2000
93views more  LOGCOM 2000»
13 years 6 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
CSL
2010
Springer
13 years 7 months ago
Complexity Results for Modal Dependence Logic
Modal dependence logic was introduced very recently by V
Peter Lohmann, Heribert Vollmer
ICALP
2009
Springer
14 years 6 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong