Formal foundations for RDF/S KB evolution

Giorgos Flouris, George Konstantinidis, Grigoris Antoniou, Vassilis Christophides

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

There are ongoing efforts to provide declarative formalisms of integrity constraints over RDF/S data. In this context, addressing the evolution of RDF/S knowledge bases while respecting associated constraints is a challenging issue, yet to receive a formal treatment. We provide a theoretical framework for dealing with both schema and data change requests. We define the notion of a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change. The semantics of such an operator are subject to customization, by tuning the properties that a rational change should adhere to. We prove some interesting theoretical results and propose a general-purpose algorithm for implementing rational change operators in knowledge bases with integrity constraints, which allows us to handle uniformly any possible change request in a provably rational and consistent manner. Then, we apply our framework to a well-studied RDF/S variant, for which we suggest a specific notion of minimality. For efficiency purposes, we also describe specialized versions of the general evolution algorithm for the RDF/S case, which provably have the same semantics as the general-purpose one for a limited set of (useful in practice) types of change requests.

LanguageEnglish
Pages153-191
Number of pages39
JournalKnowledge and Information Systems
Volume35
Issue number1
Early online date17 May 2012
DOIs
Publication statusPublished - 1 Apr 2013

Fingerprint

Semantics
Mathematical operators
Tuning

Cite this

Flouris, Giorgos ; Konstantinidis, George ; Antoniou, Grigoris ; Christophides, Vassilis. / Formal foundations for RDF/S KB evolution. In: Knowledge and Information Systems. 2013 ; Vol. 35, No. 1. pp. 153-191.
@article{81337542096348a48e8f47a990fe0cf5,
title = "Formal foundations for RDF/S KB evolution",
abstract = "There are ongoing efforts to provide declarative formalisms of integrity constraints over RDF/S data. In this context, addressing the evolution of RDF/S knowledge bases while respecting associated constraints is a challenging issue, yet to receive a formal treatment. We provide a theoretical framework for dealing with both schema and data change requests. We define the notion of a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change. The semantics of such an operator are subject to customization, by tuning the properties that a rational change should adhere to. We prove some interesting theoretical results and propose a general-purpose algorithm for implementing rational change operators in knowledge bases with integrity constraints, which allows us to handle uniformly any possible change request in a provably rational and consistent manner. Then, we apply our framework to a well-studied RDF/S variant, for which we suggest a specific notion of minimality. For efficiency purposes, we also describe specialized versions of the general evolution algorithm for the RDF/S case, which provably have the same semantics as the general-purpose one for a limited set of (useful in practice) types of change requests.",
keywords = "Change operator, Curated KBs, Evolution in the presence of integrity constraints, Integrity constraints, Principle of Minimal Change, RDF/S evolution",
author = "Giorgos Flouris and George Konstantinidis and Grigoris Antoniou and Vassilis Christophides",
year = "2013",
month = "4",
day = "1",
doi = "10.1007/s10115-012-0500-2",
language = "English",
volume = "35",
pages = "153--191",
journal = "Knowledge and Information Systems",
issn = "0219-1377",
publisher = "Springer London",
number = "1",

}

Flouris, G, Konstantinidis, G, Antoniou, G & Christophides, V 2013, 'Formal foundations for RDF/S KB evolution', Knowledge and Information Systems, vol. 35, no. 1, pp. 153-191. https://doi.org/10.1007/s10115-012-0500-2

Formal foundations for RDF/S KB evolution. / Flouris, Giorgos; Konstantinidis, George; Antoniou, Grigoris; Christophides, Vassilis.

In: Knowledge and Information Systems, Vol. 35, No. 1, 01.04.2013, p. 153-191.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Formal foundations for RDF/S KB evolution

AU - Flouris, Giorgos

AU - Konstantinidis, George

AU - Antoniou, Grigoris

AU - Christophides, Vassilis

PY - 2013/4/1

Y1 - 2013/4/1

N2 - There are ongoing efforts to provide declarative formalisms of integrity constraints over RDF/S data. In this context, addressing the evolution of RDF/S knowledge bases while respecting associated constraints is a challenging issue, yet to receive a formal treatment. We provide a theoretical framework for dealing with both schema and data change requests. We define the notion of a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change. The semantics of such an operator are subject to customization, by tuning the properties that a rational change should adhere to. We prove some interesting theoretical results and propose a general-purpose algorithm for implementing rational change operators in knowledge bases with integrity constraints, which allows us to handle uniformly any possible change request in a provably rational and consistent manner. Then, we apply our framework to a well-studied RDF/S variant, for which we suggest a specific notion of minimality. For efficiency purposes, we also describe specialized versions of the general evolution algorithm for the RDF/S case, which provably have the same semantics as the general-purpose one for a limited set of (useful in practice) types of change requests.

AB - There are ongoing efforts to provide declarative formalisms of integrity constraints over RDF/S data. In this context, addressing the evolution of RDF/S knowledge bases while respecting associated constraints is a challenging issue, yet to receive a formal treatment. We provide a theoretical framework for dealing with both schema and data change requests. We define the notion of a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change. The semantics of such an operator are subject to customization, by tuning the properties that a rational change should adhere to. We prove some interesting theoretical results and propose a general-purpose algorithm for implementing rational change operators in knowledge bases with integrity constraints, which allows us to handle uniformly any possible change request in a provably rational and consistent manner. Then, we apply our framework to a well-studied RDF/S variant, for which we suggest a specific notion of minimality. For efficiency purposes, we also describe specialized versions of the general evolution algorithm for the RDF/S case, which provably have the same semantics as the general-purpose one for a limited set of (useful in practice) types of change requests.

KW - Change operator

KW - Curated KBs

KW - Evolution in the presence of integrity constraints

KW - Integrity constraints

KW - Principle of Minimal Change

KW - RDF/S evolution

UR - http://www.scopus.com/inward/record.url?scp=84875435264&partnerID=8YFLogxK

U2 - 10.1007/s10115-012-0500-2

DO - 10.1007/s10115-012-0500-2

M3 - Article

VL - 35

SP - 153

EP - 191

JO - Knowledge and Information Systems

T2 - Knowledge and Information Systems

JF - Knowledge and Information Systems

SN - 0219-1377

IS - 1

ER -