Chain Stratification: A New Semantics for RDF Rules with Negation
A recent study published on arXiv (2607.28778) introduces chain stratification as a solid criterion to maintain effective semantics for RDF rule languages, such as N3 and SHACL Rules, particularly when default negation is involved. The authors tackle issues where current stratification techniques fall short due to insufficient information in individual triples, which hinders dependency restrictions, and the presence of blank nodes in rule heads that complicates the order of rule application. By integrating an analysis of potential multistep derivations with integrity constraints, chain stratification eliminates impossible scenarios. Following this method ensures a unique, streamlined RDF graph regardless of the order of rule application. This extended version also discusses existential rules broadly and is significant for the digital art and cultural heritage sectors, where RDF rules play a role in linked data for art metadata.
Key facts
- arXiv paper 2607.28778 proposes chain stratification for RDF rules with negation.
- Addresses challenges in combining RDF rule languages (N3, SHACL Rules) with default negation.
- Existing stratification methods fail for RDF rules due to insufficient triple-level information.
- Blank nodes in rule heads complicate rule application order and negation applicability.
- Chain stratification guarantees a unique, lean RDF graph regardless of rule application order.
- The condition combines multistep derivation analysis with integrity constraints.
- The paper covers existential rules in general, not just RDF.
- Published as an extended version on arXiv.
Entities
Institutions
- arXiv