header

Defining and Computing Least Common Subsumers in RDF

27 Pages Posted: 25 Jun 2018 First Look: Accepted

See all articles by S. Colucci

S. Colucci

Politecnico di Bari

F. Donini

Università degli studi della Tuscia

S. Giannini

Politecnico di Bari

E. Di Sciascio

Politecnico di Bari

Abstract

Several application scenarios in the Web of Data share the need to identify the commonalities between a pair of RDF resources. Motivated by such needs, we propose the definition and the computation of Least Common Subsumers (LCSs) in RDF. To this aim, we provide some original and fundamental reformulations, to deal with the peculiarities of RDF. First, we adapt a few definitions from Graph Theory to paths and connectedness in RDF-graphs. Second, we define rooted RDF-graphs (r-graphs), in order to focus on a particular resource inside an RDF-graph. Third, we change the definitions of LCSs originally set up for Description Logics to r-graphs. According to the above reformulations, we investigate the computational properties of LCS in RDF, and find a polynomial-time characterization using a form of graph composition. This result remarkably distinguishes LCSs from Entailment in RDF, which is an NP-complete graph matching problem. We then devise algorithms for computing an LCS. A prototypical implementation works as a proof-of-concept for the whole approach in three application scenarios, and shows usefulness and feasibility of our proposal. Most of our examples are taken directly from real datasets, and are fully replicable thanks to the fact that the choice about which triples are selected for the computation is made explicit and flexible.

Keywords: Least Common Subsumer, RDF, Rooted-graph, Selection of RDF triples, RDF simple-entailment

Suggested Citation

Colucci, S. and Donini, F. and Giannini, S. and Di Sciascio, E., Defining and Computing Least Common Subsumers in RDF (2016). Journal of Web Semantics First Look. Available at SSRN: https://ssrn.com/abstract=3199239 or http://dx.doi.org/10.2139/ssrn.3199239

S. Colucci (Contact Author)

Politecnico di Bari ( email )

Via Edoardo Orabona
Bari, 70123
Italy

F. Donini

Università degli studi della Tuscia ( email )

Rettorato, Via S.M.in Gradi n.4
Viterbo, 01100
Italy

S. Giannini

Politecnico di Bari ( email )

Via Edoardo Orabona
Bari, 70123
Italy

E. Di Sciascio

Politecnico di Bari ( email )

Via Edoardo Orabona
Bari, 70123
Italy

Register to save articles to
your library

Register

Paper statistics

Abstract Views
96
Downloads
1