Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
Reinhard Pichler, Axel Polleres, Fang Wei, Stefan ...
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...