Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/44783
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJAKUBOWSKI, Maxime-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.editorKirrane, S.-
dc.contributor.editorSimkus, M.-
dc.contributor.editorSoylu, A.-
dc.contributor.editorRoman, D.-
dc.date.accessioned2024-12-09T08:06:00Z-
dc.date.available2024-12-09T08:06:00Z-
dc.date.issued2024-
dc.date.submitted2024-12-04T13:08:18Z-
dc.identifier.citationKirrane, S.; Simkus, M.; Soylu, A.; Roman, D. (Ed.). Rules and reasoning, RULEML+RR 2024, SPRINGER INTERNATIONAL PUBLISHING AG, p. 1 -13-
dc.identifier.isbn978-3-031-72406-0; 978-3-031-72407-7-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/1942/44783-
dc.description.abstractThere are several situations where it is desirable to be able to extract a subgraph from an RDF graph, based on a node in the graph, and given a shape that the node conforms to. Such a subgraph can be called a neighborhood. We discuss desiderata for neighborhoods, and compare different possible definitions. We show connections with data provenance and causality. We also show how to obtain provenance polynomials for the shape constraint language SHACL from the work of Dannert and Gradel.-
dc.language.isoen-
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AG-
dc.relation.ispartofseriesLecture Notes in Computer Science-
dc.rightsThe Author(s), under exclusive license to Springer Nature Switzerland AG 2024-
dc.titleWhat's in a Neighborhood? Describing Nodes in RDF Graphs Using Shapes-
dc.typeProceedings Paper-
local.bibliographicCitation.conferencedate2024, September 16-18-
local.bibliographicCitation.conferencename8th International Joint Conference on Rules and Reasoning (RuleML+RR)-
local.bibliographicCitation.conferenceplaceBucharest, ROMANIA-
dc.identifier.epage13-
dc.identifier.spage1-
dc.identifier.volume15183-
local.format.pages13-
local.bibliographicCitation.jcatC1-
dc.description.notesVan den Bussche, J (corresponding author), Univ Hasselt, Data Sci Inst, Hasselt, Belgium.-
dc.description.notesjan.vandenbussche@uhasselt.be-
local.publisher.placeGEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
dc.identifier.doi10.1007/978-3-031-72407-7_1-
dc.identifier.isi001329984900001-
dc.identifier.eissn1611-3349-
local.provider.typewosris-
local.bibliographicCitation.btitleRules and reasoning, RULEML+RR 2024-
local.description.affiliation[Jakubowski, Maxime; Van den Bussche, Jan] Univ Hasselt, Data Sci Inst, Hasselt, Belgium.-
local.uhasselt.internationalno-
item.fulltextWith Fulltext-
item.contributorJAKUBOWSKI, Maxime-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorKirrane, S.-
item.contributorSimkus, M.-
item.contributorSoylu, A.-
item.contributorRoman, D.-
item.embargoEndDate2025-09-11-
item.fullcitationJAKUBOWSKI, Maxime & VAN DEN BUSSCHE, Jan (2024) What's in a Neighborhood? Describing Nodes in RDF Graphs Using Shapes. In: Kirrane, S.; Simkus, M.; Soylu, A.; Roman, D. (Ed.). Rules and reasoning, RULEML+RR 2024, SPRINGER INTERNATIONAL PUBLISHING AG, p. 1 -13.-
item.accessRightsEmbargoed Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Rules and Reasoning.pdf
  Restricted Access		Published version410.04 kBAdobe PDFView/Open    Request a copy
paper_inv-1.pdf
  Until 2025-09-11		Peer-reviewed author version284.64 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.