Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...
Chorems are schematized representations of territories, and so they can represent a good visual summary of spatial databases. Indeed for spatial decision-makers, it is more importa...
Vincenzo Del Fatto, Robert Laurini, Karla Lopez, R...
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...