PulseAugur
LIVE 04:09:06
research · [2 sources] ·
0
research

Researchers explore static analysis of recursive SHACL for RDF data validation

By PulseAugur Editorial · Summary by gemini-2.5-flash-lite from 2 sources

This paper introduces a novel approach to the static analysis of recursive SHACL documents, which are used to define constraints on RDF data. The research investigates the decidability of determining if all graphs validating one SHACL document also validate another. The study reveals that this implication problem is undecidable for supported and stable model semantics but decidable in single exponential time under well-founded semantics. AI

Summary written by gemini-2.5-flash-lite from 2 sources. How we write summaries →

IMPACT Introduces new decidability results for constraint languages, potentially impacting knowledge graph validation and reasoning systems.

RANK_REASON This is a research paper published on arXiv detailing a novel technical contribution to static analysis of a specific language.

Read on arXiv cs.AI →

COVERAGE [2]

  1. arXiv cs.AI TIER_1 · Anouk Oudshoorn, Magdalena Ortiz, Mantas Simkus ·

    Static Analysis of Recursive SHACL

    arXiv:2605.02787v1 Announce Type: cross Abstract: SHACL (Shapes Constraint Language) expresses constraints on RDF data by means of so-called shapes. Its central service is validation: verifying whether a data graph complies with a SHACL document. But so far, there are no static a…

  2. arXiv cs.AI TIER_1 · Mantas Simkus ·

    Static Analysis of Recursive SHACL

    SHACL (Shapes Constraint Language) expresses constraints on RDF data by means of so-called shapes. Its central service is validation: verifying whether a data graph complies with a SHACL document. But so far, there are no static analysis services to compare documents. In this pap…

RELATED ENTITIES

RELATED TOPICS