Sciweavers

291 search results - page 29 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
ENTCS
2007
90views more  ENTCS 2007»
13 years 7 months ago
Undecidability of Multi-modal Hybrid Logics
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...
Martin Mundhenk, Thomas Schneider 0002
FSTTCS
2005
Springer
14 years 1 months ago
Fixpoint Logics on 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
KGC
1993
Springer
13 years 11 months ago
Nonmonotonic Reasoning is Sometimes Simpler
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...
Grigori Schwarz, Miroslaw Truszczynski
IFIP
2004
Springer
14 years 1 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot
FLAIRS
2008
13 years 10 months ago
Modelling Uniformity and Control during Knowledge Acquisition
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...
Bernhard Heinemann