Towards Learning Commonalities in SPARQL

Abstract : Finding the commonalities between descriptions of data or knowledge is a foundational reasoning problem of Machine Learning, which amounts to computing a least general generalization (lgg) of such descriptions. We revisit this old problem in the popular conjunctive fragment of SPARQL, a.k.a. Basic Graph Pattern Queries (BGPQs). In particular, we define this problem in all its generality by considering general BGPQs, while the literature considers unary tree-shaped BGPQs only. Further, when ontological knowledge is available as RDF Schema constraints, we take advantage of it to devise much more pregnant lggs.
Liste complète des métadonnées

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01508720
Contributor : François Goasdoué <>
Submitted on : Wednesday, April 26, 2017 - 9:01:46 AM
Last modification on : Thursday, February 7, 2019 - 4:20:57 PM
Document(s) archivé(s) le : Thursday, July 27, 2017 - 12:28:39 PM

File

EGJ-ESWC17-poster.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01508720, version 2

Citation

Sara El Hassad, François Goasdoué, Hélène Jaudoin. Towards Learning Commonalities in SPARQL. Extended Semantic Web Conference (ESWC), May 2017, Portoroz, Slovenia. ⟨hal-01508720v2⟩

Share

Metrics

Record views

374

Files downloads

167