Named Graphs is a simple, compatible extension to the RDF syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF r...
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
In the context of the Semantic Web, many ontology-related operations, e.g. ontology ranking, segmentation, alignment, articulation, reuse, evaluation, can reduced to one fundamenta...
Bo Hu, Yannis Kalfoglou, Harith Alani, David Duppl...
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...