Inferring SHACL Constraints for Results of Composable Graph Queries
(Extended Abstract)
P. Seifer, D. Hernández, R. Lämmel, and S. Staab. Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024, volume 3739 of CEUR Workshop Proceedings, CEUR-WS.org, (June 2024)
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 through SHACL 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 at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be 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 ALCHOI description logic. This extended abstract summarizes our previous work.
%0 Conference Paper
%1 DBLP:conf/dlog/Seifer0LS24
%A Seifer, Philipp
%A Hernández, Daniel
%A Lämmel, Ralf
%A Staab, Steffen
%B Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024
%D 2024
%E Giordano, Laura
%E Jung, Jean Christoph
%E Ozaki, Ana
%I CEUR-WS.org
%K ac-krbuilding
%T Inferring SHACL Constraints for Results of Composable Graph Queries
(Extended Abstract)
%U https://ceur-ws.org/Vol-3739/abstract-23.pdf
%V 3739
%X 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 through SHACL 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 at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be 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 ALCHOI description logic. This extended abstract summarizes our previous work.
@inproceedings{DBLP:conf/dlog/Seifer0LS24,
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 through SHACL 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 at the end of a data processing pipeline without knowing the particular input data: Shape constraints on the input graph may affect the output graph, but may no longer apply literally, and new shapes may be 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 ALCHOI description logic. This extended abstract summarizes our previous work.},
added-at = {2025-02-25T17:58:18.000+0100},
author = {Seifer, Philipp and Hern{\'{a}}ndez, Daniel and L{\"{a}}mmel, Ralf and Staab, Steffen},
bibsource = {dblp computer science bibliography, https://dblp.org},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26ce1af2d7e64aba3b21fa18604ac86c7/analyticcomp},
booktitle = {Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024},
editor = {Giordano, Laura and Jung, Jean Christoph and Ozaki, Ana},
interhash = {0996cff044559b5f8d8d49fb1d73cf40},
intrahash = {6ce1af2d7e64aba3b21fa18604ac86c7},
keywords = {ac-krbuilding},
month = jun,
publisher = {CEUR-WS.org},
series = {{CEUR} Workshop Proceedings},
timestamp = {2025-02-25T17:58:50.000+0100},
title = {Inferring {SHACL} Constraints for Results of Composable Graph Queries
(Extended Abstract)},
url = {https://ceur-ws.org/Vol-3739/abstract-23.pdf},
volume = 3739,
year = 2024
}