Stable Model Semantics for Recursive SHACL

Andreşel, Medina; Corman, Julien; Ortiz, Magdalena; Reutter, Juan L.; Savković, Ognjen; Šimkus, Mantas

doi:10.1145/3366423.3380229

Cited by 18 publications

(61 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Def a set of rules of the form s ← φ with s a shape name (referred to as the head of the rule) and φ a shape (the body of the rule), such that each s ∈ S appears exactly once in the head of a rule, and • T a set of (concept) inclusions of the form φ ⊆ s, with φ a shape that does not mention any shape names 1 , and s a shape name. 1 The condition that φ does not mention any shape names will entail that the target query can be evaluated on the underlying…”

Section: Formalization Of Shaclmentioning

confidence: 99%

Fixpoint Semantics for Recursive SHACL

Bogaerts¹,

Jakubowski²

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. The recommendation only specifies semantics for non-recursive SHACL; recently, some efforts have been made to allow recursive SHACL schemas. In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning. We show that from a SHACL schema, a three-valued semantic operator can directly be obtained. Building on Approximation Fixpoint Theory (AFT), this operator immediately induces a wide variety of semantics, including a supported, stable, and well-founded semantics, related in the expected ways. By building on AFT, a rich body of theoretical results becomes directly available for SHACL. As such, the main contribution of this short paper is providing theoretical foundations for the study of recursive SHACL, which can later enable an informed decision for an extension of the W3C recommendation.

show abstract

Section: Formalization Of Shaclmentioning

confidence: 99%

Fixpoint Semantics for Recursive SHACL

Bogaerts¹,

Jakubowski²

2021

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…In this work, we consider previously introduced extended semantics of SHACL that define how to interpret recursive SHACL documents. These can be characterised by two dimensions, namely the choice between (1) partial and total assignments [8] and (2) between brave and cautious validation [2], which we will subsequently formally introduce. Together, these two dimensions result in the four extended semantics studied in this article, namely brave-partial, brave-total, cautiouspartial and cautious-total.…”

Section: Semantics Of Full Shaclmentioning

confidence: 99%

“…Together, these two dimensions result in the four extended semantics studied in this article, namely brave-partial, brave-total, cautiouspartial and cautious-total. We do not consider the less obvious dimension of stable-model semantics [2], which relates to non-monotone reasoning in logic programs.…”

Section: Semantics Of Full Shaclmentioning

confidence: 99%

“…Another dimension in the choices for extended semantics studied in literature [2] is the difference between brave and cautious validation of recursive documents. When a SHACL document M is recursive, there might exist multiple assignments satisfying property (1) of Definition 3, that is, multiple σ for which (G, σ) |= M \t .…”

Section: Semantics Of Full Shaclmentioning

confidence: 99%

“…Recent work [8] has suggested a theoretical modelling of the language in order to formally define a recursive semantics; the same work also studied the complexity of the validation problem. Alternative recursive semantics for SHACL have been further suggested in [2].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SHACL Satisfiability and Containment

Pareti

Konstantinidis

Mogavero

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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.

show abstract

Incremental Validation of RDF Graphs

Wang

Liu

2021

Web Information Systems and Applications

View full text Add to dashboard Cite

Stable Model Semantics for Recursive SHACL

Cited by 18 publications

References 16 publications

Fixpoint Semantics for Recursive SHACL

Fixpoint Semantics for Recursive SHACL

SHACL Satisfiability and Containment

Incremental Validation of RDF Graphs

Contact Info

Product

Resources

About