DOC PREVIEW
UTD CS 6314 - RDF and RDF Schema - Part 1

This preview shows page 1-2-3-4-29-30-31-32-33-60-61-62-63 out of 63 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Slide 24Slide 25Slide 26Slide 27Slide 28Slide 29Slide 30Slide 31Slide 32Slide 33Slide 34Slide 35Slide 36Slide 37Slide 38Slide 39Slide 40Slide 41Slide 42Slide 43Slide 44Slide 45Slide 46Slide 47Slide 48Slide 49Slide 50Slide 51Slide 52Slide 53Slide 54Slide 55Slide 56Slide 57Slide 58Slide 59Slide 60Slide 61Slide 62Slide 63RDF and RDF Schema - Part 1Grigoris AntoniouFrank van HarmelenEdited by Jeff PartykaLecture Outline1. Basic Ideas of RDF 2. RDF Serializations3. Basic Concepts of RDF Schema4. Τhe Language of RDF Schema5. Direct Semantics based on Inference RulesDrawbacks of XMLXML is a universal metalanguage for defining markupIt provides a uniform framework for interchange of data and metadata between applicationsHowever, XML does not provide any means of talking about the semantics (meaning) of datae.g., there is no intended meaning associated with the nesting of tags—it is up to each application to interpret the nestingNesting of Tags in XML David Billington is a lecturer of Discrete Maths<course name="Discrete Maths"><lecturer>David Billington</lecturer></course>...versus...<lecturer name="David Billington"><teaches>Discrete Maths</teaches></lecturer>Opposite nesting, same information!REVIEW: Basic Ideas of RDFBasic building block: object-attribute-value triple–It is called a statement or a triple–Sentence about Billington is such a statement RDF has been given a syntax in XML–RDF/XML is the official syntax for representing RDF–Other syntactic representations of RDF possibleREVIEW: Basic Ideas of RDF (2)The fundamental concepts of RDF are:–Resources–Properties–StatementsREVIEW: ResourcesWe can think of a resource as an object, a “thing” we want to talk about–e.g., authors, books, publishers, places, people, hotelsEvery resource has a URI, a Universal Resource Identifier A URI can be –a URL (Web address) or –some other kind of unique identifier –IRI: URI that supports UnicodeREVIEW: PropertiesProperties are a special kind of resourcesThey describe relations between resources–e.g., “written by”, “age”, “title”, etc. Properties are also identified by URIs Advantages of using URIs:–Α global, worldwide, unique naming scheme–Reduces the homonym problem of distributed data representationREVIEW: StatementsStatements assert the properties of resourcesA statement is an object-attribute-value triple–It consists of a resource, a property, and a valueValues can be resources or literals –Literals are atomic values (strings)REVIEW: Examples of RDF Triples( http://www.cit.gu.edu.au#DBillington,http://www.w3.org/1999/02/22-rdf-syntax-ns#type,http://www.cit.gu.edu.au #lecturer )( http://www.cit.gu.edu.au#DBillington,http://www.example.com/predicates#hasName,“David Billington” )REVIEW: Three Views of a StatementA tripleA part of a graphA piece of XML codeThus an RDF document can be viewed as:A set of triplesA graph An XML documentREVIEW: Statements as Triples( http://www.cit.gu.edu.au/~db,http://www.mydomain.org#site-owner,http://www.cit.gu.edu.au#DBillington )The triple (x,P,y) can be considered as a logical formula P(x,y)–Binary predicate P relates object x to object y –RDF offers only binary predicates (properties)–“The uncle problem”REVIEW: XML VocabulariesA directed graph with labeled nodes and arcs–from the resource (the subject of the statement) –to the value (the object of the statement)Known in AI as a semantic netThe value of a statement may be a resource–Ιt may be linked to other resourceshttp://www.cit.gu.edu.au #DBillingtonREVIEW: A Set of Triples as a Semantic Nethttp://www.cit.gu.edu.au #DBillington3975 507Sharing and Interchange with XMLWith XML, it was possible to represent the same semantics in multiple ways. It was not expressive enough on its own.A schema was necessary to structure the semantics embedded in the documentThe order of the tags is tied to the semantics of the documentHowever, many schema might be possible for a given XML documentXML documents have a tree structureSharing and Interchange with RDFWith RDF, a separate schema definition to describe structure is not necessaryThis is because RDF triples can be described as a graphAny order of triple specification will result in the same graphThis makes it possible to combine arbitrary RDF graphs without caring about the order of combinationStatements in XML SyntaxGraphs are a powerful tool for human understanding butThe Semantic Web vision requires machine-accessible and machine-processable representationsRDF can also be expressed as an XML document in RDF/XML formData TypesData types are used in programming languages to allow interpretationIn RDF, typed literals are used, if necessary( http://www.cit.gu.edu.au#DBillington,http://www.mydomain.org/age,“27”^^http://www.w3.org/2001/XMLSchema#integer )Data Types (2)^^ - notation indicates the type of a literal In practice, the most widely used data typing scheme will be XML Schema –But the use of any externally defined data typing scheme is allowed in RDF documentsXML Schema predefines a large range of data types–e.g., booleans, integers, floating-point numbers, times, dates, etc.Binary PredicatesRDF uses only binary properties–This is a restriction because, to the contrary, we often use predicates with more than 2 arguments(the “uncle problem” – to be discussed later)–But binary predicates can simulate theseExample: referee(X, Y, Z) –X is the referee in a chess game between players Y and ZBinary Predicates (2)We introduce:–a new auxiliary resource chessGame–the binary predicates referee, player1, and player2We can represent referee(X, Y, Z) as:Lecture Outline1. Basic Ideas of RDF 2. RDF Serializations3. Basic Concepts of RDF Schema4. Τhe Language of RDF Schema5. Direct Semantics based on Inference RulesWays to Serialize RDF as textRDF/XMLTurtle – Terse RDF Triple Language (subset of N3)N-TriplesJSON-LD – New(er)!●See: “JSON-LD and Why I Hate the Semantic Web” 2014RDF/XML SerializationRDF/XML is the W3C recommended serialization for RDF as of February 2004This MUST be supported by all well-behaved Semantic Web ApplicationsThere


View Full Document

UTD CS 6314 - RDF and RDF Schema - Part 1

Download RDF and RDF Schema - Part 1
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view RDF and RDF Schema - Part 1 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view RDF and RDF Schema - Part 1 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?