Reasoning about knowledge
Computable analysis: an introduction
Computable analysis: an introduction
Modal logic
A Road-Map on Complexity for Hybrid Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
About the Temporal Decrease of Sets
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Knowledge over Dense Flows of Time (from a Hybrid Point of View)
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
The logic of communication graphs
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
This paper is about a synthesis of two quite different modal reasoning formalisms: the logic of subset spaces, and hybrid logic. Going beyond commonly considered languages we introduce names of objects involving sets and corresponding satisfaction operators, thus increase the expressive power to a large extent. The motivation for our approach is to logically model some general notions from topology like closeness, separation, and linearity, which are of fundamental relevance to spatial or temporal frameworks; in other words, since these notions represent basic properties of space and time we want them to be available to corresponding formal reasoning. We are interested in complete axiomatizations and effectivity properties of the associated logical systems, in particular.