148 search results - page 15 / 30 » On the Complexity of Elementary Modal Logics |
ENTCS
2007
14 years 11 months ago
2007
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
104
click to vote
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
ACTA
2004
14 years 11 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
100
click to vote
KGC
1993
Springer
15 years 3 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
92
Voted
FLAIRS
2008
15 years 2 months ago
2008
We develop a formal system dealing `spatially' with certain aspects of uniformity and control during knowledge acquisition. To this end, we study an appropriate modality, whi...