We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
Jacopo Urbani, Spyros Kotoulas, Eyal Oren, Frank v...
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
In an open distributed system, computational resources are peer-owned, and distributed over time and space. The fact that these resources can dynamically join or leave the system (...
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...