SHACL constraints with inference rules

Name: SHACL constraints with inference rules
Author: Pareti, P., Konstantinidis, G., Norman, T. J., Şensoy, Murat

İsim	SHACL constraints with inference rules
Yazar	Pareti, P., Konstantinidis, G., Norman, T. J., Şensoy, Murat
Basım Tarihi:	2019
Basım Yeri	- Springer Nature
Tür	Belge
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	978-3-030-30792-9
Kayıt Numarası	34c2b3f0-a2c7-4e7b-985c-082c84413ab7
Lokasyon	Computer Science
Tarih	2019
Notlar	Institutional Links grant under the Newton-Katip Celebi Fund ; UK Department for Business, Energy and Industrial Strategy ; TÜBİTAK
Örnek Metin	The Shapes Constraint Language (SHACL) has been recently introduced as a W3C recommendation to define constraints that can be validated against RDF graphs. Interactions of SHACL with other Semantic Web technologies, such as ontologies or reasoners, is a matter of ongoing research. In this paper we study the interaction of a subset of SHACL with inference rules expressed in datalog. On the one hand, SHACL constraints can be used to define a "schema" for graph datasets. On the other hand, inference rules can lead to the discovery of new facts that do not match the original schema. Given a set of SHACL constraints and a set of datalog rules, we present a method to detect which constraints could be violated by the application of the inference rules on some graph instance of the schema, and update the original schema, i.e, the set of SHACL constraints, in order to capture the new facts that can be inferred. We provide theoretical and experimental results of the various components of our approach.
Editör	Ghidini, C., Hartig, O., Maleshkova, M., Svatek, V., Cruz, I., Hogan, A., Song, J., Lefrancois, M., Gandon, F.
DOI	10.1007/978-3-030-30793-6_31
Cilt	11778

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

SHACL constraints with inference rules

Yazar Pareti, P., Konstantinidis, G., Norman, T. J., Şensoy, Murat

Basım Tarihi 2019

Basım Yeri - Springer Nature

Tür Belge

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 978-3-030-30792-9

Kayıt Numarası 34c2b3f0-a2c7-4e7b-985c-082c84413ab7

Lokasyon Computer Science

Tarih 2019

Notlar Institutional Links grant under the Newton-Katip Celebi Fund ; UK Department for Business, Energy and Industrial Strategy ; TÜBİTAK

Örnek Metin The Shapes Constraint Language (SHACL) has been recently introduced as a W3C recommendation to define constraints that can be validated against RDF graphs. Interactions of SHACL with other Semantic Web technologies, such as ontologies or reasoners, is a matter of ongoing research. In this paper we study the interaction of a subset of SHACL with inference rules expressed in datalog. On the one hand, SHACL constraints can be used to define a "schema" for graph datasets. On the other hand, inference rules can lead to the discovery of new facts that do not match the original schema. Given a set of SHACL constraints and a set of datalog rules, we present a method to detect which constraints could be violated by the application of the inference rules on some graph instance of the schema, and update the original schema, i.e, the set of SHACL constraints, in order to capture the new facts that can be inferred. We provide theoretical and experimental results of the various components of our approach.

Editör Ghidini, C., Hartig, O., Maleshkova, M., Svatek, V., Cruz, I., Hogan, A., Song, J., Lefrancois, M., Gandon, F.

DOI 10.1007/978-3-030-30793-6_31

Cilt 11778