In the context of process algebras it is customary to define semantics in the form of a reaction relation supported by a structural congruence relation. Recently process algebras...
Henrik Pilegaard, Flemming Nielson, Hanne Riis Nie...
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
Since the description of the Semantic Web paradigm in 2001, technology has been proposed to allow its deployment and use. However, there is not yet any large and widely deployed s...
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
Partial replication is a way to increase the scalability of replicated systems since updates only need to be applied to a subset of the system's sites, thus allowing replicas...