Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/36449
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bogaerts, Bart | - |
dc.contributor.author | JAKUBOWSKI, Maxime | - |
dc.date.accessioned | 2022-01-11T11:07:12Z | - |
dc.date.available | 2022-01-11T11:07:12Z | - |
dc.date.issued | 2021 | - |
dc.date.submitted | 2021-12-15T16:51:54Z | - |
dc.identifier.citation | Electronic proceedings in theoretical computer science, 345, p. 41 -47 | - |
dc.identifier.issn | 2075-2180 | - |
dc.identifier.uri | http://hdl.handle.net/1942/36449 | - |
dc.description.abstract | SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. The recommendation only specifies semantics for non-recursive SHACL; recently, some efforts have been made to allow recursive SHACL schemas. In this paper, we argue that for defining and studying semantics of recursive SHACL, lessons can be learned from years of research in non-monotonic reasoning. We show that from a SHACL schema, a three-valued semantic operator can directly be obtained. Building on Approximation Fixpoint Theory (AFT), this operator immediately induces a wide variety of semantics, including a supported, stable, and well-founded semantics, related in the expected ways. By building on AFT, a rich body of theoretical results becomes directly available for SHACL. As such, the main contribution of this short paper is providing theoretical foundations for the study of recursive SHACL, which can later enable an informed decision for an extension of the W3C recommendation. | - |
dc.language.iso | en | - |
dc.publisher | - | |
dc.rights | © B. Bogaerts & M. Jakubowski This work is licensed under the Creative Commons Attribution License. | - |
dc.title | Fixpoint Semantics for Recursive SHACL | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | 20/09/2021 - 27/09/2021 | - |
local.bibliographicCitation.conferencename | International Conference on Logic Programming (Technical Communications) 2021 (ICLP 2021) | - |
local.bibliographicCitation.conferenceplace | Porto, Portugal | - |
dc.identifier.epage | 47 | - |
dc.identifier.spage | 41 | - |
dc.identifier.volume | 345 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.identifier.doi | 10.4204/EPTCS.345.14 | - |
dc.identifier.eissn | - | |
local.provider.type | CrossRef | - |
local.uhasselt.uhpub | yes | - |
item.fulltext | With Fulltext | - |
item.contributor | Bogaerts, Bart | - |
item.contributor | JAKUBOWSKI, Maxime | - |
item.validation | vabb 2024 | - |
item.fullcitation | Bogaerts, Bart & JAKUBOWSKI, Maxime (2021) Fixpoint Semantics for Recursive SHACL. In: Electronic proceedings in theoretical computer science, 345, p. 41 -47. | - |
item.accessRights | Open Access | - |
crisitem.journal.issn | 2075-2180 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2109.08285v1.pdf | Published version | 179.57 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
4
checked on Oct 14, 2024
Page view(s)
28
checked on Sep 7, 2022
Download(s)
16
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.