This is a demo for validating an RDF data graph with an RDF rule graph containing one or more shape definitions using the shape rule language (SHRL). SHRL is based upon augmented transition networks. Each shape matches one or more data nodes. The shape is associated with a network of rules, where each rule matches a given triple and applies tests based upon the number of matching triples and their value for literal nodes. The rules are chained together using logical operators (and, or, one and not). More information is available in this slide presentation.
Created by Dave Raggett <dsr@w3.org>.