© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Why URI Declarations? A comparison.

Slides:



Advertisements
Similar presentations
Interoperability and semantics in RDF representations of FRBR, FRAD and FRSAD Gordon Dunsire Presented at the Cologne Conference on Interoperability and.
Advertisements

The following 10 questions test your knowledge of Internet-based client management in Configuration Manager Configuration Manager 2007 Internet-Based.
The following 10 questions test your knowledge of desired configuration management in Configuration Manager Configuration Manager Desired Configuration.
Statistics Hypothesis Testing.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross By Herbert I. Gross and Richard A. Medeiros next Set 9.
StormingForce.com Motion. StormingForce.com StormingForce’s technology is significantly increasing productivity and quality of manual repetitive tasks.
RDF Tutorial.
ISBN Chapter 3 Describing Syntax and Semantics.
© 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.
© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Enterprise Information Integration.
OASIS Reference Model for Service Oriented Architecture 1.0
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 15 Basics of Functional Dependencies and Normalization for Relational.
Commercial Law (Mgmt 348) Professor Charles H. Smith The Statute of Frauds-Writing Requirement (Chapter 15) Spring 2009.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3 The Basic (Flat) Relational Model.
Semantic Search Jiawei Rong Authors Semantic Search, in Proc. Of WWW Author R. Guhua (IBM) Rob McCool (Stanford University) Eric Miller.
MODERN AUDITING 7th Edition Developed by: Dr. Raymond N. Johnson, CPA Gregory K. Lowry, MBA, CPA John Wiley & Sons, Inc. William C. Boynton California.
1 LR parsing techniques SLR (not in the book) –Simple LR parsing –Easy to implement, not strong enough –Uses LR(0) items Canonical LR –Larger parser but.
Rights management Vicky Weissman
Describing Syntax and Semantics
Consensus Hunt Game Click here to continue Click here to continue.
MODULE C - LEGAL SUBMODULES C1. Conflict Of Interest/Code Of Ethics C2. Antitrust C3. Torts C4. Intellectual Property C5. Speaking For The Society.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 20 By Herbert I. Gross and Richard A. Medeiros next.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
Real Numbers and Their Properties รายวิชา ค ความรู้พื้นฐานสำหรับแคลคูลัส 1 ภาคเรียนที่ 1 ปีการศึกษา 2552.
RDF (Resource Description Framework) Why?. XML XML is a metalanguage that allows users to define markup XML separates content and structure from formatting.
Interoperability Scenario Producing summary versions of compound multimedia historical documents.
Denotation as a Two-Step Mapping in Semantic Web Architecture David Booth, Ph.D. Cleveland Clinic (contractor) Identity Workshop, IJCAI 2009, Pasadena.
Requirements Engineering meets UML 1st. September 2007 Richard Farr, Cybernetic Intelligence GmbH.
INF 384 C, Spring 2009 Ontologies Knowledge representation to support computer reasoning.
2-Oct-15 Bojan Orlic, TU/e Informatica, System Architecture and Networking 12-Oct-151 Homework assignment 1 feedback Bojan Orlic Architecture.
A GENERIC PROCESS FOR REQUIREMENTS ENGINEERING Chapter 2 1 These slides are prepared by Enas Naffar to be used in Software requirements course - Philadelphia.
1 Clustering of search engine results by Google CWI, Amsterdam, The Netherlands Vrije Universiteit.
Rome, Aug. 30,  Current status of vocabularies  Reorganization of CGI workgroups  Vocabulary resource management  Change URI scheme from URN.
Resource Identity and Semantic Extensions: Making Sense of Ambiguity David Booth, Ph.D. Cleveland Clinic (contractor) Semantic Technology Conference 25-June-2010.
©Silberschatz, Korth and Sudarshan2.1Database System Concepts Chapter 2: Entity-Relationship Model Entity Sets Relationship Sets Design Issues Mapping.
Mathematics Numbers: Absolute Value of Functions I Science and Mathematics Education Research Group Supported by UBC Teaching and Learning Enhancement.
Web Architecture: Extensible Language Tim Berners-Lee, Dan Connolly World Wide Web Consortium 元智資工所 系統實驗室 楊錫謦 1999/9/15.
P15 Lai Xiaoni (U077151L) Qiao Li (U077194E) Saw Woei Yuh (U077146X) Wang Yong (U077138Y)
CSE314 Database Systems Basics of Functional Dependencies and Normalization for Relational Databases Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E.
Java server pages. A JSP file basically contains HTML, but with embedded JSP tags with snippets of Java code inside them. A JSP file basically contains.
EHR Standards Project DSTU Basic Observations Professional Service July 05, 2006 Webcast.
LAC group, 16/06/2011. So far...  Directed graphical models  Bayesian Networks Useful because both the structure and the parameters provide a natural.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
CSE314 Database Systems Lecture 3 The Relational Data Model and Relational Database Constraints Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson.
Mutation Testing G. Rothermel. Fault-Based Testing White-box and black-box testing techniques use coverage of code or requirements as a “proxy” for designing.
Ontology Quality by Detection of Conflicts in Metadata Budak I. Arpinar Karthikeyan Giriloganathan Boanerges Aleman-Meza LSDIS lab Computer Science University.
Le parc japonais est beau et calme La fille japonaise est belle mais bavarde Ritsurin Park, Takamatsu.
Formal Specification: a Roadmap Axel van Lamsweerde published on ICSE (International Conference on Software Engineering) Jing Ai 10/28/2003.
The Akoma Ntoso Naming Convention Fabio Vitali University of Bologna.
Knowledge Technologies Manolis Koubarakis 1 Some Other Useful Features of RDF.
© Copyright 2015 STI INNSBRUCK PlanetData D2.7 Recommendations for contextual data publishing Ioan Toma.
© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Uncertainty reasoning for Linked.
Slide 1 Systems Analysis and Design with UML Version 2.0, Second Edition Alan Dennis, Barbara Wixom, and David Tegarden Chapter 9: Moving on to Design.
Linked Data Publishing on the Semantic Web Dr Nicholas Gibbins
CM Spec analysis Markup from discussion 15/3. Summary of the scenario by way of the key business entities & their relationships CR Req Implem System or.
XML Namespaces In this first lesson XML Namespaces, you will learn to:
Linked Data & Semantic Web Technology The Semantic Web Part 3. URI for the Semantic Web Dr. Myungjin Lee.
Artificial Intelligence Logical Agents Chapter 7.
Using Parallelspace TEAM Models to Design and Create Custom Profiles
EDU 385 Session 8 Writing Selection items
Jenn Riley Metadata Librarian Digital Library Program
Parallelspace PowerPoint Template for ArchiMate® 2.1 version 1.1
Parallelspace PowerPoint Template for ArchiMate® 2.1 version 2.0
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases.
Linear Inequalities and Absolute Value
MODULE C - LEGAL SUBMODULES C1. Conflict Of Interest/Code Of Ethics
HOW TO WRITE A SYSTEMATIC/NARRATIVE REVIEW
Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases.
LOD reference architecture
Jenn Riley Metadata Librarian Digital Library Program
Presentation transcript:

© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Why URI Declarations? A comparison of architectural approaches David Booth, Ph.D. HP Software European Semantic Web Conference 2008 Workshop on Identity and Reference Latest version of these slides: Related paper: Views expressed herein are those of the author and do not necessarily reflect those of HP.

2 Three important roles URI owner: Mints a URI, e.g., Statement author: Uses the URI to make an assertion, e.g., :s :v. Consuming application: Reads the assertion and needs to determine what it means.

3 The problem Given an RDF statement, what does it mean? :s :v. What resource does denote?

4 URI denotes a resource URI Real world interpretation Denotes Directly ? (A person)... but how?

5 Two-step mapping from URI to resource URI Set of assertions ("URI definition") Step 1 foaf:name "David Booth". foaf:workplaceHomepage. Real world interpretation Step 2

6 Set of assertions ("URI definition") Two-step mapping from URI to resource URI Set of assertions ("URI definition") Step 1 Real world interpretation Step 2 foaf:name "David Booth". foaf:workplaceHomepage. foaf:name "David Booth". foaf:workplaceHomepage.

7 Set of assertions ("URI definition") Two-step mapping from URI to resource URI Set of assertions ("URI definition") Step 1 Real world interpretation Step 2 foaf:name "David Booth". foaf:workplaceHomepage. Step 2 interpretation: denotes whatever resource satisfies these assertions.

8 Two-step mapping from URI to resource URI Set of assertions ("URI definition") foaf:name "David Booth". foaf:workplaceHomepage. Step 1 Real world interpretation Step 2 Semantic web architecture can only govern step 1! Scope of semantic web architecture

9 URI definition determines meaning Given :s :v. What URI definition did the statement author intend?

10 Two architectural approaches Competing definitions: All assertions are created equal. Statement author decides which definition to use. URI declarations: Use of a URI implies agreement with its follow-your-nose* definition**. −If you disagree with the f-y-n definition, then use a different URI (and relate it to the original URI) Statement author decides which URI to use. *Via 303-redirect or removing #fragID from the URI **At the time the statement involving the URI was made

11 Competing definitions approach 1. How can the statement author indicate what definition was used? rdf:isDefinedBy or owl:imports do not necessarily have this meaning. Hence, consuming app cannot be guaranteed of getting the correct definition. This problem could be addressed by standardization. 2. Alternate URI definitions cause URI collisionURI collision Same URI has different meaning in different contexts Complicates data merging 2. Alternate URI definitions cause URI collisionURI collision

12 URI declarations approach 1. What if the f-y-n definition is clearly erroneous? E.g., domain was hijacked Statement authors can use a new URI that deprecates the old URI Consuming apps can use a URI translating proxy to get an alternate definition

13 Problem: How to indicate a relationship to a URI while disagreeing with its definition Scenario: Alice has published a URI: Bob disagrees with one assertion in Alice's URI definition: cos:pluto a cos:planet. Bob publishes a new URI: Bob's URI definition is similar to Alice's except that it omits the offending assertion. For this reason it is broader (less constraining) than Alice's definition. Question: How can Bob indicate the relationship between his URI and Alice's URI? Observation: Bob's URI definition is skos:broader than Alice's −It omits the offending assertion The following statement would indicate the relationship: skos:broader*. # WRONG! But it would also indicate agreement with the offending assertion! *Update 16-Jan-2009: This example is also incorrect because skos:broader is being asserted between the resources denoted by and rather than between their URI definitions. For more explanation see

14 Solution To avoid indicating agreement with Alice's assertions, Bob can instead write: _:aliceFoo log:uri " _:aliceFoo skos:broader*. Explanation: log:uri relates a resource to a URI that denotes it. For any URI u, if u is used to denote a resource, then the following relationship is implied: log:uri "u". * Correction 16-Jan-2009: The skos:broader assertion above is between the two resources denoted by and when it should have been between their URI definitions. As described in the assertion between their URI definitions can be made as follows without indicating agreement with Alice's assertions: " s:isNarrowerThan "

15 owl:sameAs Creates value −Permits data to be merged. Good! Also creates problems when combining data Contradiction does not mean that the data is wrong! −Models may be okay for one context, but inadequate for another E.g., modeling the earth as flat is good enough for driving directions This problem will never go away! −Avoid it when possible −But be prepared when it happens

16 Scenario (owl:sameAs) File1 says a:a owl:sameAs b:b. File2 says b:b owl:sameAs c:c. File1 and File2 each work fine by themselves, but cause a contradiction when used together. How can we deal with this?

17 owl:sameAs effectively creates a new node a:a b:b _:ab skos:broader _:ab definition combines assertions from URI definitions of a:a and b:b Data that merged a:a and b:b effectively used _:ab To confine a conflict, s/a:a/_:ab/g in File1 (or analogously in File2) Clarification 16-Jan-2009: The skos:broader relation shown above should be between the URI definitions -- not between the resources denoted by _:ab and a:a or _:ab and b:b. a:a :a1 :x1. a:a :a2 :x2. a:a :a3 :x3. Definition _:ab :a1 :x1. _:ab :a2 :x2. _:ab :a3 :x3. _:ab :b1 :y1. _:ab :b2 :y2. _:ab :b3 :y3. Definition b:b :b1 :y1. b:b :b2 :y2. b:b :b3 :y3. Definition

18 Ambiguity and owl:sameAs Ambiguity is undesirable but unavoidable −An identity that was good enough for one app may be insufficiently precise for another Pat Hayes the physical body? At what point in time? Pat Hayes the legal entity? Uses of owl:sameAs would be vanishingly few if limited to cases of identical URI definitions owl:sameAs can be viewed as an expression of belief: for this app/context, these two URIs denote the same resource.

19 AKT example AKT protein is discovered −URI is minted: :akt Years later, research determines that there are actually three distinct proteins: AKT1, AKT2, AKT3 −New URIs are minted: :akt1, :akt2, :akt3 :akt is good enough for many applications −Do not change it! −Indicate that it has been deprecated by :akt1, :akt2, :akt3 :akt skos:narrower* :akt1, :akt2, :akt3. *Correction 16-Jan-2009: skos:narrower is making an assertion between the resources denoted by :akt, :akt1, :akt2 and :akt3, when the assertion should have been between their associated URI definitions (though the example does not show their URIs). Using s:isBroaderThanResource as described in the above line could have been correctly written as: :akt s:isBroaderThanResource :akt1, :akt2, :akt3. However, it would have been better to express the relationship through URIs, using s:isBroaderThan, such as: " s:isBroaderThan " " "

20 httpRange-14 implications denotes both: −Mark Baker the person −Mark Baker's web page Architecturally, this is no different from AKT example! THEREFORE: Using the same URI to denote both a person and a web page: −is not a violation of web architecture, but −is a violation of good practice

21 Good practice guidelines for minting URIs Support follow-your-nose dereferencing to URI declaration −http URIs −Use #hash or 303-redirect URIs Put only defining properties in the URI declaration Make distinctions that users are likely to need −e.g., distinguish a person from his/her web page URI declaration should also link to a page describing: −Known sources of "ancillary" assertions -- including yours −Related URIs (skos:broader/skos:narrower/skos:related) Clearly indicate the change policy for your URI declaration Indicate the date last modified Do not change your URI declaration −Except in accordance with its change policy Use persistent URLs (PURLs)

© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Questions?