Log In Sign Up

SHACL Constraints with Inference Rules

by   Paolo Pareti, et al.

The Shapes Constraint Language (SHACL) has been recently introduced as a W3C recommendation to define constraints that can be validated against RDF graphs. Interactions of SHACL with other Semantic Web technologies, such as ontologies or reasoners, is a matter of ongoing research. In this paper we study the interaction of a subset of SHACL with inference rules expressed in datalog. On the one hand, SHACL constraints can be used to define a "schema" for graph datasets. On the other hand, inference rules can lead to the discovery of new facts that do not match the original schema. Given a set of SHACL constraints and a set of datalog rules, we present a method to detect which constraints could be violated by the application of the inference rules on some graph instance of the schema, and update the original schema, i.e, the set of SHACL constraints, in order to capture the new facts that can be inferred. We provide theoretical and experimental results of the various components of our approach.


page 1

page 2

page 3

page 4


Rule Applicability on RDF Triplestore Schemas

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

Semantic Reasoning with Differentiable Graph Transformations

This paper introduces a differentiable semantic reasoner, where rules ar...

A Review of SHACL: From Data Validation to Schema Reasoning for RDF Graphs

We present an introduction and a review of the Shapes Constraint Languag...

Inference rules for RDF(S) and OWL in N3Logic

This paper presents inference rules for Resource Description Framework (...

Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies

Answering conjunctive queries (CQs) over a set of facts extended with ex...

Bayesian Inference of a Social Graph with Trace Feasibility Guarantees

Network inference is the process of deciding what is the true unknown gr...