Compliance checking in reified IO logic via SHACL
This work addresses compliance verification for norms in domains such as legal systems, but it appears incremental as it applies an existing method (SHACL) to a new data type (reified I/O logic).
The paper tackles the problem of compliance checking for reified I/O logic, which models real-world norms from natural language sentences like legislation, by translating these logic formulae into SHACL shapes to validate RDF graphs describing states of affairs.
Reified Input/Output (I/O) logic[21] has been recently proposed to model real-world norms in terms of the logic in [11]. This is massively grounded on the notion of reification, and it has specifically designed to model meaning of natural language sentences, such as the ones occurring in existing legislation. This paper presents a methodology to carry out compliance checking on reified I/O logic formulae. These are translated in SHACL (Shapes Constraint Language) shapes, a recent W3C recommendation to validate and reason with RDF triplestores. Compliance checking is then enforced by validating RDF graphs describing states of affairs with respect to these SHACL shapes.