<div class="csl-bib-body">
<div class="csl-entry">Oudshoorn, A. M., Ahmetaj, S., Ortiz, M., & Simkus, M. (2024, June 25). <i>Combining SHACL and description logics</i> [Conference Presentation]. Logic Colloquium 2024, Göteburg, Sweden.</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/204745
-
dc.description.abstract
A standardised and widely used way to organise structured knowledge on the internet are knowledge graphs (KGs). Description logics (DLs), a family of modal logic like logics, can formally describe KGs and define reasoning rules like each student has a student number. However, DLs are not suitable for defining constraints on data: the goal is to find out which parts of the data are not satisfying the constraints, instead of adding the logical consequences, or conclude that the theory is unsatisfiable. For this purpose, the SHACL standard was created. SHACL is a constraint language that has a description logic flavour, and contains features like regular path expressions, negation and recursion.
SHACL reasoners perform validation, while DL reasoners logical inference. Integrating these two tasks into one uniform approach is a relevant but challenging problem. We address this problem by proposing an intuitive semantics for validating SHACL constraints combined with some lightweight DLs. Moreover, we propose an algorithm that rewrites a set of recursive SHACL constraints (with stratified negation, i.e., not allowing the full combination of negation and recursion) combined with DL inference rules, into a stand-alone set of SHACL constraints that preserves validation for every input graph. This is done by pre-computing the results of the inference rules and implementing this in the constraints. We show that validation in this setting is EXPTIME-complete in combined complexity, but only PTIME-complete in data complexity, i.e., if the constraints and the inference rules are fixed.
en
dc.language.iso
en
-
dc.subject
SHACL
en
dc.subject
Description Logics
en
dc.subject
Validation
en
dc.subject
Rewriting
en
dc.title
Combining SHACL and description logics
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.type.category
Conference Presentation
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-03 - Forschungsbereich Knowledge Based Systems
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
tuw.author.orcid
0009-0006-4638-5948
-
tuw.author.orcid
0000-0002-2344-9658
-
tuw.author.orcid
0000-0003-0632-0294
-
tuw.event.name
Logic Colloquium 2024
en
tuw.event.startdate
24-06-2024
-
tuw.event.enddate
28-06-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Göteburg
-
tuw.event.country
SE
-
tuw.event.presenter
Oudshoorn, Anouk Michelle
-
tuw.event.track
Multi Track
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.openairetype
conference paper not in proceedings
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-03 - Forschungsbereich Knowledge Based Systems
-
crisitem.author.dept
E192-03 - Forschungsbereich Knowledge Based Systems
-
crisitem.author.dept
E192-03 - Forschungsbereich Knowledge Based Systems
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
