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...
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
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...
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...
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...