Inferring SHACL constraints for results of composable graph queries

Seifer, Philipp, Hernandez, Daniel, Lämmel, Ralf and Staab, Steffen (2024) Inferring SHACL constraints for results of composable graph queries. 37th International Workshop on Description Logics, , Bergen, Norway. 18 - 21 Jun 2024. 6 pp . (In Press)

Record type: Conference or Workshop Item (Paper)

Abstract

SPARQL CONSTRUCT queries allow for the specification of data processing pipelines that transform given input graphs into new output graphs. Input graphs are now commonly constrained throughSHACL shapes allowing for both their validation and aiding users (as well as tools) in understanding their structure. However, it becomes challenging to understand what graph data can be expected atthe end of a data processing pipeline without knowing the particular input data: Shape constraints onthe input graph may affect the output graph, but may no longer apply literally, and new shapes maybe imposed by the query itself. In our recent work, From Shapes to Shapes: Inferring SHACL Shapes for Results of SPARQL CONSTRUCT Queries, we studied the derivation of shape constraints that hold on all possible output graphs of a given SPARQL CONSTRUCT query by axiomatizing the query and the shapes with the

Text

DL_Workshop___Shapes_to_Shapes - Accepted Manuscript

Available under License Creative Commons Attribution.

Download (775kB)