Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/44783| Title: | What's in a Neighborhood? Describing Nodes in RDF Graphs Using Shapes | Authors: | JAKUBOWSKI, Maxime VAN DEN BUSSCHE, Jan |
Editors: | Kirrane, S. Simkus, M. Soylu, A. Roman, D. |
Issue Date: | 2024 | Publisher: | SPRINGER INTERNATIONAL PUBLISHING AG | Source: | Kirrane, S.; Simkus, M.; Soylu, A.; Roman, D. (Ed.). Rules and reasoning, RULEML+RR 2024, SPRINGER INTERNATIONAL PUBLISHING AG, p. 1 -13 | Series/Report: | Lecture Notes in Computer Science | Abstract: | There 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. | Notes: | Van den Bussche, J (corresponding author), Univ Hasselt, Data Sci Inst, Hasselt, Belgium. jan.vandenbussche@uhasselt.be |
Document URI: | http://hdl.handle.net/1942/44783 | ISBN: | 978-3-031-72406-0; 978-3-031-72407-7 | DOI: | 10.1007/978-3-031-72407-7_1 | ISI #: | 001329984900001 | Rights: | The Author(s), under exclusive license to Springer Nature Switzerland AG 2024 | Category: | C1 | Type: | Proceedings Paper |
| Appears in Collections: | Research publications |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Rules and Reasoning.pdf Restricted Access | Published version | 410.04 kB | Adobe PDF | View/Open Request a copy |
| paper_inv-1.pdf Until 2025-09-11 | Peer-reviewed author version | 284.64 kB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.