Rule applicability on RDF triplestore schemas
Rule applicability on RDF triplestore schemas
Rule-based systems play a critical role in health and safety, where policies created by experts are usually formalised as rules. When dealing with increasingly large and dynamic sources of data, as in the case of Internet of Things (IoT) applications, it becomes important not only to efficiently apply rules, but also to reason about their applicability on datasets confined by a certain schema. In this paper we define the notion of a triplestore schema which models a set of RDF graphs. Given a set of rules and such a schema as input we propose a method to determine rule applicability and produce output schemas. Output schemas model the graphs that would be obtained by running the rules on the graph models of the input schema. We present two approaches: one based on computing a canonical (critical) instance of the schema, and a novel approach based on query rewriting. We provide theoretical, complexity and evaluation results that show the superior efficiency of our rewriting approach.
Pareti, Paolo
c4337eaa-f206-4639-afd2-3bcbfe734cdb
Konstantinidis, Georgios
f174fb99-8434-4485-a7e4-bee0fef39b42
Norman, Timothy
663e522f-807c-4569-9201-dc141c8eb50d
Şensoy, Murat
769b0b6a-705b-456a-ab3d-123bca9cc66a
Pareti, Paolo
c4337eaa-f206-4639-afd2-3bcbfe734cdb
Konstantinidis, Georgios
f174fb99-8434-4485-a7e4-bee0fef39b42
Norman, Timothy
663e522f-807c-4569-9201-dc141c8eb50d
Şensoy, Murat
769b0b6a-705b-456a-ab3d-123bca9cc66a
Pareti, Paolo, Konstantinidis, Georgios, Norman, Timothy and Şensoy, Murat
(2019)
Rule applicability on RDF triplestore schemas.
IJCAI 2019: Workshop on AI for Internet of Things, Macao, China, Macao, Macao.
12 Aug 2019.
7 pp
.
(In Press)
Record type:
Conference or Workshop Item
(Paper)
Abstract
Rule-based systems play a critical role in health and safety, where policies created by experts are usually formalised as rules. When dealing with increasingly large and dynamic sources of data, as in the case of Internet of Things (IoT) applications, it becomes important not only to efficiently apply rules, but also to reason about their applicability on datasets confined by a certain schema. In this paper we define the notion of a triplestore schema which models a set of RDF graphs. Given a set of rules and such a schema as input we propose a method to determine rule applicability and produce output schemas. Output schemas model the graphs that would be obtained by running the rules on the graph models of the input schema. We present two approaches: one based on computing a canonical (critical) instance of the schema, and a novel approach based on query rewriting. We provide theoretical, complexity and evaluation results that show the superior efficiency of our rewriting approach.
Text
_AI4IoT_workshop__Rule_Applicability_on_RDF_Triplestore_Schemas (1)
- Accepted Manuscript
Restricted to Repository staff only
Request a copy
More information
Accepted/In Press date: 31 May 2019
Venue - Dates:
IJCAI 2019: Workshop on AI for Internet of Things, Macao, China, Macao, Macao, 2019-08-12 - 2019-08-12
Identifiers
Local EPrints ID: 432325
URI: http://eprints.soton.ac.uk/id/eprint/432325
PURE UUID: f32b0c54-2f8f-4e21-a49e-4d876bf2c270
Catalogue record
Date deposited: 10 Jul 2019 16:30
Last modified: 16 Mar 2024 04:24
Export record
Contributors
Author:
Paolo Pareti
Author:
Georgios Konstantinidis
Author:
Murat Şensoy
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics