Sciweavers

132 search results - page 2 / 27
» Lower bounds for modal logics
Sort
View
AIML
2006
13 years 6 months ago
A General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
Robert Goldblatt, Edwin D. Mares
ICALP
2010
Springer
13 years 7 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
MST
2011
207views Hardware» more  MST 2011»
13 years 6 days ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
MFCS
2009
Springer
13 years 11 months ago
Future-Looking Logics on Data Words and Trees
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
Diego Figueira, Luc Segoufin
LICS
2006
IEEE
13 years 11 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson