Đang chuẩn bị liên kết để tải về tài liệu:
Coloured petri nets based approach for manipulating RDF data

This paper introduces a solution for controlling RDF data manipulation operations. We propose a formal approach to manage any modification, query or adaptation of the data to satisfy end-user/application criteria (e.g., RDF filtering). | Journal of Automation and Control Engineering Vol. 3, No. 2, April 2015 Coloured Petri Nets-based Approach for Manipulating RDF Data Thi-Hoa-Hue Nguyen and Nhan Le Thanh WIMMICS - The I3S laboratory – CNRS, University of Nice Sophia Antipolis, Sophia Antipolis, France Email: nguyenth@i3s.unice.fr, Nhan.LE-THANH@unice.fr Abstract—This paper introduces a solution for controlling RDF data manipulation operations. We propose a formal approach to manage any modification, query or adaptation of the data to satisfy end-user/application criteria (e.g., RDF filtering). An overview of the RDF data manipulation framework with its main components is first presented. We then introduce the RDF-oriented Composition Definition Language (RDFCDL) including the syntax and its graphical representations defined based on CPNs. The language aims to support both expert and non-expert developers to create/compose RDF manipulation operations. Besides, an ontology for representing manipulating processes modelled with the RDFCDL language is developed in order to share and reuse the processes more easily. To the best of our knowledge, this is the first approach providing a means for end-users to create manipulation nodes over RDF data based upon system-defined functions and allowing manipulating processes to be stored in RDF file format. Index Terms—CPN, knowledge base, OWL DL ontology, RDF Data manipulation, RDF I. INTRODUCTION A knowledge base is an organized information repository. It provides a means for manipulating information, such as collecting, organizing, sharing, searching and using. According to [1], a knowledge base can be either machine-readable or intended for human use. Here we pay particular attention to the case of machinereadable knowledge bases designed for automated deductive reasoning. We consider ontologies expressed in RDF(S) or/and OWL that are a means of representing semantic knowledge. The world is constantly full of changes, therefore it does generally not .