This paper studies default negation in RDF rule languages such as N3 and SHACL Rules. It argues that conventional stratification methods are insufficient because individual triples cannot capture meaningful dependencies, while blank nodes in rule heads can create new values whose timing changes the applicability of negated rules. The authors propose chain stratification, which analyzes potential multistep derivations and uses integrity constraints to eliminate impossible cases. According to the abstract, any rule order respecting this condition derives an RDF graph that is unique, lean, and justified under usual negation-as-failure semantics. A prototype implementation is also provided.
No heat snapshots are available in the last 24 hours.