Semantics and Validation of Recursive SHACL
Autor: | Ognjen Savkovic, Julien Corman, Juan L. Reutter |
---|---|
Rok vydání: | 2018 |
Předmět: |
Theoretical computer science
Semantics (computer science) Computer science Yield (finance) 010401 analytical chemistry 02 engineering and technology computer.file_format 01 natural sciences Popularity 0104 chemical sciences Schema (genetic algorithms) 020204 information systems ComputingMethodologies_DOCUMENTANDTEXTPROCESSING 0202 electrical engineering electronic engineering information engineering Rdf graph RDF Independent data computer |
Zdroj: | Lecture Notes in Computer Science ISBN: 9783030006709 ISWC (1) |
Popis: | With the popularity of RDF as an independent data model came the need for specifying constraints on RDF graphs, and for mechanisms to detect violations of such constraints. One of the most promising schema languages for RDF is SHACL, a recent W3C recommendation. Unfortunately, the specification of SHACL leaves open the problem of validation against recursive constraints. This omission is important because SHACL by design favors constraints that reference other ones, which in practice may easily yield reference cycles. |
Databáze: | OpenAIRE |
Externí odkaz: |