W3C PROV Constraints ISWC 2013 Paul Groth slide help from Ivan Herman.

Slides:



Advertisements
Similar presentations
1 Copyright ©2007 Sandpiper Software, Inc. Vocabulary, Ontology & Specification Management at OMG Elisa Kendall Sandpiper Software
Advertisements

Cambridge Semantic Web Gathering , Cambridge, MA, USA Ivan Herman W3C, Semantic Web Activity Lead.
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Decision Table Based Testing
The Semantic Web – WEEK 4: RDF
April 15, 2004SPIE1 Association in Level 2 Fusion Mieczyslaw M. Kokar Christopher J. Matheus Jerzy A. Letkowski Kenneth Baclawski Paul Kogut.
A BRIEF INTRO TO THE PROV DATA MODEL Simon Miles The entire W3C Provenance Working Group.
Basic notation for supertype/subtype relationships
Ivan Herman W3C. (2)  Current RDF has been published in 2004  Significant deployment since then ◦ implementation experiences ◦ users’ experiences 
1 CP3024 Lecture 9 XML revisited, XSL, XSLT, XPath, XSL Formatting Objects.
© 2006 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice RDF and SOA David Booth, Ph.D. HP.
Software Engineering COMP 201
Chapter 6 Methodology Logical Database Design for the Relational Model Transparencies © Pearson Education Limited 1995, 2005.
A year on the Semantic W3C (or: what is happening these days?) Semantic Web Meetup, Seattle, Ivan Herman, W3C.
Introduction to XLink Transparency No. 1 XML Information Set W3C Recommendation 24 October 2001 (1stEdition) 4 February 2004 (2ndEdition) Cheng-Chia Chen.
Methodology Logical Database Design for the Relational Model
1 SWE Introduction to Software Engineering Lecture 5.
Overview of Software Requirements
RDF: Building Block for the Semantic Web Jim Ellenberger UCCS CS5260 Spring 2011.
1 Conceptual Modeling of Topic Maps with ORM Versus UML Are D. Gulbrandsen The XML group, Center for Information Technology Services, University of Oslo,
--The Entity Relationship Model(4)--1 Outline  ER model  Overview  Entity types Attributes, keys  Relationship types  Weak entity types  uses Integration.
LOGICAL DATABASE DESIGN
Identifying things. Four rules of linked data Use URIs as names for things Use HTTP URIs so that people can look up those names. When someone looks up.
Michael F. Price College of Business Chapter 6: Logical database design and the relational model.
Database Constraints. Database constraints are restrictions on the contents of the database or on database operations Database constraints provide a way.
DartGrid Browser-based mapping tool of SQL to RDF Point Template Zhejiang University & OpenLink Software.
Vocabulary Services “Huuh - what is it good for…” (in WDTS anyway…) 4 th September 2009 Jonathan Yu CSIRO Land and Water.
CS 310 Ch8: System models Abstract descriptions of systems being analyzed to help the analyst understand the system functionality communicate with customers.
MIS 385/MBA 664 Systems Implementation with DBMS/ Database Management Dave Salisbury ( )
INF 384 C, Spring 2009 Ontologies Knowledge representation to support computer reasoning.
© 2006 ITT Educational Services Inc. SE350 System Analysis for Software Engineers: Unit 8 Slide 1 Chapter 9 Structuring System Data Requirements.
RDF and OWL Developing Semantic Web Services by H. Peter Alesso and Craig F. Smith CMPT 455/826 - Week 6, Day Sept-Dec 2009 – w6d21.
Processing of structured documents Spring 2002, Part 2 Helena Ahonen-Myka.
© Copyright 2008 STI INNSBRUCK NLP Interchange Format José M. García.
Normalization (Codd, 1972) Practical Information For Real World Database Design.
HL-LHC Configuration Management Keywords : HW Baseline, Naming, Parameters, Layout DB, Change Control The HiLumi LHC Design Study (a sub-system of HL-LHC)
Rule Learning - Overview Goal: Syntactic Transfer Rules 1) Flat Seed Generation: produce rules from word- aligned sentence pairs, abstracted only to POS.
ISO TC184/SC4 contribution to REACH and LCA David Leal CAESAR Systems Limited and the impact of the Semantic Web on the.
L To identify the services that the customer requires from a system and the constraints under which it operates and is developed.
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
Description of Information Resources: RDF/RDFS (an Introduction)
Ontology Quality by Detection of Conflicts in Metadata Budak I. Arpinar Karthikeyan Giriloganathan Boanerges Aleman-Meza LSDIS lab Computer Science University.
CASRAI Consortia Advancing Standards in Research Administration Information David Baker, Executive Director.
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 4 Slide 1 Software Processes.
1 RIF Design Roadmap Draft PM Harold Boley (NRC), Michael Kifer (Stony Brook U), Axel Polleres (DERI), Jos de Bruijn (DERI), Michael Sintek.
XML Validation. a simple element containing text attribute; attributes provide additional information about an element and consist of a name value pair;
OWL W3C WORKING GROUP F2F MEETING M. Vacura. OWL 2  OWL 2 extends the OWL 1.0 with a small but useful set of features that have been requested by users,
CompSci Problem Solving: Sudoku  Rules of the Game Sudoku is played with a 9 by 9 "board" consisting of nine 3 by 3 sub-boards. The symbols 1 -
Jackson, Web Technologies: A Computer Science Perspective, © 2007 Prentice-Hall, Inc. All rights reserved Chapter 7 Representing Web Data:
What is the Semantic Web? 17 th XBRL International Conference Eindhoven, the Netherlands 5 st May, 2008 Ivan Herman, W3C.
BTM 382 Database Management Chapter 5: Advanced Data Modeling
1 The Relational Data Model David J. Stucki. Relational Model Concepts 2 Fundamental concept: the relation  The Relational Model represents an entire.
Dr. Alexandra I. Cristea SPARQL Exerciess.
Semantics of RDF(S) and OWL Ivan Herman, W3C (Last update: 28 Sep 2007) Ivan Herman.
Database Constraints ICT 011. Database Constraints Database constraints are restrictions on the contents of the database or on database operations Database.
Overview of the Semantic Web Ralph R. Swick World Wide Web Consortium (W3C) 17 October 2009.
Tutorial on Semantic Web
Chapter 4: Business Process and Functional Modeling, continued
Methodology Logical Database Design for the Relational Model
Business System Development
Authority versus authenticity: the shift from labels to identifiers
RDF and RDB 1 Some slides adapted from a presentation by Ivan Herman at the Semantic Technology & Business Conference, 2012.
MIS 322 – Enterprise Business Process Analysis
Jun Zhao University of Oxford
Overview of the Semantic Web Ralph R
Ivan Herman W3C/CWI, EdTech Conference November, 2017
Relational Database.
Consumer Rights Lesson
Linked Open Data in 10 Minutes Sandro Hawke, W3C
Consumer Rights Lesson
Presentation transcript:

W3C PROV Constraints ISWC 2013 Paul Groth slide help from Ivan Herman

Provenance statements can become fairly complicated  In some applications it may become advantageous to check the validity of the provenance structures. Checking provenance statements (“Constraints”) e2 e1

Definition of the constraints entity( ) activity(:WritingTheBook) wasGeneratedBy(,:WritingTheBook) agent(:AmitavGhosh, [prov:type='prov:Person',foaf:name='AmitavGhosh']) wasAttributedTo(,:AmitavGhosh, [roles:witRole='roles:author']) entity( ) activity(:WritingTheBook) wasGeneratedBy(,:WritingTheBook) agent(:AmitavGhosh, [prov:type='prov:Person',foaf:name='AmitavGhosh']) wasAttributedTo(,:AmitavGhosh, [roles:witRole='roles:author']) An abstract data model for provenance (with its own, abstract notation) is also published Note that the “qualified” versions are unnecessary at that level, relationships are n-ary

A separate document defines the constraints on the abstract data model – Constraints themselves are defined as a set of abstract rules – they may translated into: (partially) into OWL rules, e.g., using SPARQL – general constraint checkers on the abstract model are also doable Definition of the constraints

Normalization From an RDF perspective 1.Expand 2.Everything is already merged by virtue of URIs Blank nodes….

Events on a Lifetime :e1 :a1 generation invalidation start end

Uniqueness Constraints select ?e where { ?e prov:qualifiedGeneration ?gen1. ?gen1 prov:activity ?act. ?e prov:qualifiedGeneration ?gen2. ?gen2 prov:activity ?act. FILTER (?gen1 != ?gen2) }

Create the event timeline INSERT { ?gen c:precedes ?end. } WHERE { ?act a prov:Activity. ?act prov:qualifiedEnd ?end. ?act prov:qualifiedGeneration ?gen. } :e1

Check for cycles select ?x where { ?x (c:precedes+|c:strictlyPrecedes+)/ c:strictlyPrecedes ?x. }

Impossibility Constraint e.g. Activity & Entity disjoint select ?e where { ?e a prov:Entity, prov:Activity. }

Do you fill all the slots? select ?asc where { ?asc a prov:Association. FILTER NOT EXISTS { ?a prov:qualifiedAssociation ?asc. }

Validators Prov-check – Southampton Provenance Suite –