DeepAI AI Chat
Log In Sign Up

Inference of Shape Expression Schemas Typed RDF Graphs

by   Benoît Groz, et al.

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.


page 1

page 2

page 3

page 4


Containment of Shape Expression Schemas for RDF

We study the problem of containment for shape expression schemas (ShEx) ...

Statistics of Knowledge Graphs Based On The Conceptual Schema

In this paper, we propose a new approach for the computation of the stat...

Deciding SHACL Shape Containment through Description Logics Reasoning (Extended Version)

The Shapes Constraint Language (SHACL) allows for formalizing constraint...

Rule Applicability on RDF Triplestore Schemas

Rule-based systems play a critical role in health and safety, where poli...

Relational to RDF Data Exchange in Presence of a Shape Expression Schema

We study the relational to RDF data exchange problem, where the tar- get...

Schema-Guided Event Graph Completion

We tackle a new task, event graph completion, which aims to predict miss...

Static Analysis of Graph Database Transformations

We investigate graph transformations, defined using Datalog-like rules b...