Checking compliance of semantic web applications with RDFS‐semantics

Web applications calling themselves “Semantic” count in the hundreds, yet there is no clear definition about what this qualification should stand for. Semantic web applications may range from those just using Resource Description Framework (RDF) as a data interchange format, to those taking all RDF‐...

Full description

Saved in:
Bibliographic Details
Published in:Internet technology letters 2019-05, Vol.2 (3), p.n/a
Main Authors: Colucci, Simona, Donini, Francesco M., Di Sciascio, Eugenio
Format: Article
Language:English
Subjects:
RDF
RDF blank nodes
RDF‐S semantics
semantic web
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Web applications calling themselves “Semantic” count in the hundreds, yet there is no clear definition about what this qualification should stand for. Semantic web applications may range from those just using Resource Description Framework (RDF) as a data interchange format, to those taking all RDF‐S consequences into account. Moreover, even with the simplest semantics, RDF data may contain blank nodes, which should be treated appropriately as existential variables—but might not. In this paper, we propose a general framework of yes/no experiments whose result tell, in a black‐box fashion, how “Semantic” can be considered a given Web application. Our experiments measure the sensitivity of the application to syntactic variations of data which are equivalent under RDF‐S‐semantics. We show how our experiments can be run on a real application, namely, RapidMiner with LODExtension. We show how RapidMiner passes most of the tests (but for blank nodes), but highlight a weakness of the workflow repository‐retrieval‐exploitation that may make the application fail in some cases.
ISSN:2476-1508
2476-1508
DOI:10.1002/itl2.87