SHACL satisfiability and containment
SHACL satisfiability and containment
The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but did not consider the standard decision problems of satisfiability and containment, which are crucial for verifying the feasibility of the constraints and important for design and optimization purposes. In this paper, we undertake a thorough study of the different features of SHACL by providing a translation to a new first-order language, called SCL, that precisely captures the semantics of SHACL w.r.t. satisfiability and containment. We study the interaction of SHACL features in this logic and provide the detailed map of decidability and complexity results of the aforementioned decision problems for different SHACL sublanguages. Notably, we prove that both problems are undecidable for the full language, but we present decidable combinations of interesting features.
1-23
Pareti, Paolo
c4337eaa-f206-4639-afd2-3bcbfe734cdb
Konstantinidis, Georgios
f174fb99-8434-4485-a7e4-bee0fef39b42
Mogavero, Fabio
8a05b57c-db22-4216-95d1-7c35d5975ee1
Norman, Timothy
663e522f-807c-4569-9201-dc141c8eb50d
Pareti, Paolo
c4337eaa-f206-4639-afd2-3bcbfe734cdb
Konstantinidis, Georgios
f174fb99-8434-4485-a7e4-bee0fef39b42
Mogavero, Fabio
8a05b57c-db22-4216-95d1-7c35d5975ee1
Norman, Timothy
663e522f-807c-4569-9201-dc141c8eb50d
Pareti, Paolo, Konstantinidis, Georgios, Mogavero, Fabio and Norman, Timothy
(2020)
SHACL satisfiability and containment.
In The Semantic Web – ISWC 2020: 19th International Semantic Web Conference, Athens, Greece, November 2–6, 2020, Proceedings, Part I.
.
(In Press)
Record type:
Conference or Workshop Item
(Paper)
Abstract
The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but did not consider the standard decision problems of satisfiability and containment, which are crucial for verifying the feasibility of the constraints and important for design and optimization purposes. In this paper, we undertake a thorough study of the different features of SHACL by providing a translation to a new first-order language, called SCL, that precisely captures the semantics of SHACL w.r.t. satisfiability and containment. We study the interaction of SHACL features in this logic and provide the detailed map of decidability and complexity results of the aforementioned decision problems for different SHACL sublanguages. Notably, we prove that both problems are undecidable for the full language, but we present decidable combinations of interesting features.
Text
Pareti_ISWC_2020
- Accepted Manuscript
More information
Accepted/In Press date: 31 August 2020
Venue - Dates:
19th International Semantic Web Conference, Virtual Event, Athens, Greece, 2020-11-02 - 2020-11-06
Identifiers
Local EPrints ID: 444208
URI: http://eprints.soton.ac.uk/id/eprint/444208
PURE UUID: 90f72999-0ab5-45e7-aa7d-51dae6254c69
Catalogue record
Date deposited: 01 Oct 2020 16:34
Last modified: 17 Mar 2024 03:41
Export record
Contributors
Author:
Paolo Pareti
Author:
Georgios Konstantinidis
Author:
Fabio Mogavero
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
