Sciweavers

115 search results - page 2 / 23
» On contraction and the modal fragment
Sort
View
ICALP
2009
Springer
15 years 12 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
48
Voted
CORR
2010
Springer
85views Education» more  CORR 2010»
14 years 11 months ago
Characterization and definability in modal first-order fragments
Facundo Carreiro
CONCUR
2007
Springer
15 years 5 months ago
The Must Preorder Revisited
Abstract. We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of th...
Cosimo Laneve, Luca Padovani
104
Voted
STACS
2007
Springer
15 years 5 months ago
Bounded-Variable Fragments of Hybrid Logics
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...
Thomas Schwentick, Volker Weber
120
Voted
LOGCOM
2000
93views more  LOGCOM 2000»
14 years 11 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