Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/38989
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bogaerts, Bart | - |
dc.contributor.author | JAKUBOWSKI, Maxime | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2022-12-05T12:39:00Z | - |
dc.date.available | 2022-12-05T12:39:00Z | - |
dc.date.issued | 2022 | - |
dc.date.submitted | 2022-11-30T14:12:59Z | - |
dc.identifier.citation | Gottlob, Georg; Inclezan, Daniela; Maratea, Marco (Ed.). Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 , SPRINGER INTERNATIONAL PUBLISHING AG, p. 75 -88 | - |
dc.identifier.isbn | 978-3-031-15706-6 | - |
dc.identifier.isbn | 978-3-031-15707-3 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/1942/38989 | - |
dc.description.abstract | SHACL is a W3C-proposed language for expressing structural constraints on RDF graphs. In recent years, SHACL's popularity has risen quickly. This rise in popularity comes with questions related to its place in the semantic web, particularly about its relation to OWL (the de facto standard for expressing ontological information on the web) and description logics (which form the formal foundations of OWL). We answer these questions by arguing that SHACL is in fact a description logic. On the one hand, our answer is surprisingly simple, some might even say obvious. But, on the other hand, our answer is also controversial. By resolving this issue once and for all, we establish the field of description logics as the solid formal foundations of SHACL. | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER INTERNATIONAL PUBLISHING AG | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.rights | The Author(s), under exclusive license to Springer Nature Switzerland AG 2022 | - |
dc.subject.other | Shapes | - |
dc.subject.other | SHACL | - |
dc.subject.other | Description Logics | - |
dc.subject.other | Ontologies | - |
dc.title | SHACL: A description logic in disguise | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Gottlob, Georg | - |
local.bibliographicCitation.authors | Inclezan, Daniela | - |
local.bibliographicCitation.authors | Maratea, Marco | - |
local.bibliographicCitation.conferencedate | September 5–9, 2022 | - |
local.bibliographicCitation.conferencename | 16th International Conference, LPNMR 2022 | - |
local.bibliographicCitation.conferenceplace | Genova, Italy | - |
dc.identifier.epage | 88 | - |
dc.identifier.spage | 75 | - |
local.format.pages | 14 | - |
local.bibliographicCitation.jcat | C1 | - |
local.publisher.place | GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 13416 | - |
dc.identifier.doi | 10.1007/978-3-031-15707-3_7 | - |
dc.identifier.isi | WOS:000874750300010 | - |
dc.identifier.eissn | 1611-3349 | - |
local.provider.type | Web of Science | - |
local.bibliographicCitation.btitle | Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 | - |
local.uhasselt.international | no | - |
item.accessRights | Open Access | - |
item.contributor | Bogaerts, Bart | - |
item.contributor | JAKUBOWSKI, Maxime | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.validation | ecoom 2023 | - |
item.fullcitation | Bogaerts, Bart; JAKUBOWSKI, Maxime & VAN DEN BUSSCHE, Jan (2022) SHACL: A description logic in disguise. In: Gottlob, Georg; Inclezan, Daniela; Maratea, Marco (Ed.). Logic Programming and Nonmonotonic Reasoning, LPNMR 2022 , SPRINGER INTERNATIONAL PUBLISHING AG, p. 75 -88. | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Pages from 978-3-031-15707-3.pdf Restricted Access | Published version | 261.1 kB | Adobe PDF | View/Open Request a copy |
Genova.pdf | Peer-reviewed author version | 300.83 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.