Sciweavers

291 search results - page 12 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
IJCAI
2007
13 years 9 months ago
Coalitions in Action Logic
If modal logics for coalitions need to be applied, one must know how to translate coalition power into agents’ actions. To these days, the connection between coalition power and...
Stefano Borgo
FSTTCS
2006
Springer
13 years 11 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
CSL
2008
Springer
13 years 9 months ago
The Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
Anuj Dawar, Erich Grädel
APAL
2010
97views more  APAL 2010»
13 years 7 months ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic