Containment of Shape Expression Schemas for RDF

Staworko, Sławek; Wieczorek, Piotr

doi:10.1145/3294052.3319687

Cited by 4 publications

(3 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We point out that Typesets(s) can be constructed effectively by identifying all sets of types that have nonempty intersection, which is know to be decidable [39]. Now, for a context C = (t, a), a graph G, and a typeset T ∈ Typesets(S) we define the interval that contains the number of nodes having precisely types T in the context C…”

Section: Typed Graphsmentioning

confidence: 99%

See 1 more Smart Citation

Inference of Shape Expression Schemas Typed RDF Graphs

Groz,

Lemay,

Staworko

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is both sound i.e., always producing a schema that validates the input RDF graph, and complete i.e., able to produce any schema, within a given class of schemas, provided that a sufficiently informative input graph is presented. We study the case where the input graph is typed i.e., every node is given with its types. We limit our attention to a practical fragment ShEx0 of Shape Expressions Schemas that has an equivalent graphical representation in the form of shape graphs. We investigate the problem of constructing a canonical representative of a given shape graph. Finally, we present a sound and complete algorithm for shape graphs thus showing that ShEx0 is learnable from typed graphs.

show abstract

Section: Typed Graphsmentioning

confidence: 99%

“…We point out that its size may be exponential in the size of the goal schema and the results on the sizes of counter-examples of containment of shape graphs [39] show that this bound is tight.…”

mentioning

confidence: 92%

Inference of Shape Expression Schemas Typed RDF Graphs

Groz,

Lemay,

Staworko

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Validation of an RDF graph with ShEx therefore constructs a single assignment whereas the SHACL semantics used in this papers deals with multiple possible assignments. The containment problem of ShEx shapes has been investigated in [22]. Due to the specific definition of recursion in ShEx, any graph that conforms to the ShEx shapes will also conform to an equivalent SHACL definition.…”

Section: Related Workmentioning

confidence: 99%

Deciding SHACL Shape Containment Through Description Logics Reasoning

Leinberger

Seifer

Rienstra

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Shapes Constraint Language (SHACL) allows for formalizing constraints over RDF data graphs. A shape groups a set of constraints that may be fulfilled by nodes in the RDF graph. We investigate the problem of containment between SHACL shapes. One shape is contained in a second shape if every graph node meeting the constraints of the first shape also meets the constraints of the second. To decide shape containment, we map SHACL shape graphs into description logic axioms such that shape containment can be answered by description logic reasoning. We identify several, increasingly tight syntactic restrictions of SHACL for which this approach becomes sound and complete.

show abstract