Resource Description Framework (RDF) A basis for knowledge representation on the Web

Size: px
Start display at page:

Download "Resource Description Framework (RDF) A basis for knowledge representation on the Web"

Transcription

1 Resource Description Framework (RDF) A basis for knowledge representation on the Web Simple language to capture assertions (as statements) Captures elements of knowledge about a resource Facilitates incremental acquisition of knowledge Supports inferencing to extract and use knowledge Consolidates old KR ideas Frames Object-oriented modeling Applies URIs to Clarify meanings Handle vocabulary differences Crucial for heterogeneity Munindar P. Singh (NCSU) Service-Oriented Computing Fall

2 Why RDF? Whereas XML and JSON Produce a document tree Don t identify the content represented by a document, i.e., Concepts the document is about Relationships among the concepts Enable multiple representations for the same content RDF expresses the content itself in a standard form Munindar P. Singh (NCSU) Service-Oriented Computing Fall

3 Resources and Literals RDF captures descriptions of resources A resource is an addressable object Of which a description can be given Identified via a URI Worth talking about and possible to talk about A literal is something simpler A value, e.g., string or integer Cannot be given a description Munindar P. Singh (NCSU) Service-Oriented Computing Fall

4 Statements or Triples RDF is based on a simple grammar An RDF document is simply a set of statements also known as triples Each statement consists of Subject: a resource (starting point) Object: a resource or a literal (ending point) Predicate: a resource (connection) Comes with RDFS, a vocabulary to create vocabularies Munindar P. Singh (NCSU) Service-Oriented Computing Fall

5 Rendering RDF RDF is not about the surface syntax but about the underlying content Using the XML serialization of RDF RDF is not tied to XML Standard XML namespace syntax Namespaces defined by the RDF standard Typically abbreviated rdf and rdfs Munindar P. Singh (NCSU) Service-Oriented Computing Fall

6 Example of N-Triples Notation The basic syntax: Subject-Predicate-Object <h t t p : / /www. w i l e y. com/soc> <h t t p : / / p u r l. org / dc / e l e m e n t s / 1. 1 / t i t l e > S e r v i c e O r i e n t e d Computing. <h t t p : / /www. w i l e y. com/soc> <h t t p : / / p u r l. org / dc / e l e m e n t s / 1. 1 / c r e a t o r > Munindar. <h t t p : / /www. w i l e y. com/soc> <h t t p : / / p u r l. org / dc / e l e m e n t s / 1. 1 / c r e a t o r > M i c h a e l. <h t t p : / /www. w i l e y. com/soc> <h t t p : / / p u r l. org / dc / e l e m e n t s / 1. 1 / p u b l i s h e r > Wiley.

7 Example in XML Using the Dublin Core vocabulary <? xml v e r s i o n= 1. 0 e n c o d i n g= UTF 8?> <rdf: RDF x m l n s : r d f= h t t p : //www. w3. org /1999/02/22 r d f syntax ns# x m l n s : d c= h t t p : // p u r l. org / dc / e l e m e n t s / 1. 1 / > < r d f : D e s c r i p t i o n r d f : a b o u t= h t t p : //www. w i l e y. com/soc > < d c : t i t l e>s e r v i c e O r i e n t e d Computing</ d c : t i t l e> <d c : c r e a t o r>munindar</ d c : c r e a t o r> <d c : c r e a t o r>m i c h a e l</ d c : c r e a t o r> <d c : p u b l i s h e r>wiley</ d c : p u b l i s h e r> </ r d f : D e s c r i p t i o n> </ rdf:rdf> rdf:description gathers statements about one subject Distinguish rdf:id from rdf:about

8 Exercise Reproduce previous example in JSON Linked Data syntax Munindar P. Singh (NCSU) Service-Oriented Computing Fall

9 Exercise Graphs represent binary relationships naturally A verb plus two nouns (a transitive verb) The vendor ships SKU-99 A verb plus two nouns (including an adjective on one of the nouns) The big vendor ships the green product Express a three-party relationship A verb plus two nouns plus an adverb The vendor ships SKU-99 quickly Hint: think of gerunds from natural language grammar A verb plus three nouns (a ditransitive verb) The vendor sells Alice SKU-99 Munindar P. Singh (NCSU) Service-Oriented Computing Fall

10 Multiparty Relationships An edge has two terminals, so limited to binary relationships To represent a multiparty relationship, introduce a resource corresponding to the relationship itself That s what a gerund does in NL Analogous to an association entity Include edges originating or targeting this resource Munindar P. Singh (NCSU) Service-Oriented Computing Fall

11 RDF Schema In essence, an object-oriented type system built on top of RDF Defines rdfs:class, rdfs:subclassof, rdfs:resource, rdfs:literal, rdfs:property, rdfs:subpropertyof, rdfs:range, rdfs:domain, rdfs:label, rdfs:comment, rdfs:seealso Applications of RDF Schema Definining custom vocabularies Discussed in conjunction with OWL, which greatly enhances the above Munindar P. Singh (NCSU) Service-Oriented Computing Fall

12 RDF Schema versus XML Schema Both help define custom vocabularies An XML Schema document gives us syntactic details An RDF Schema document gives us a way to capture part of the meaning through a standard vocabulary (rdfs) An OWL document (next topic) captures richer meaning Munindar P. Singh (NCSU) Service-Oriented Computing Fall

13 Collections Function as containers rdf:bag rdf:sequence rdf:alt (choice) Accompanied by properties to extract elements Schematically represented as rdf: 1, rdf: 2, and so on That is, the properties 1, 2,... are defined in the rdf namespace Collections are applied within OWL Not otherwise emphasized in this course Munindar P. Singh (NCSU) Service-Oriented Computing Fall

14 Reification Motivation Express a quotation Alice says the vendor ships SKU-99 Hint(?): In RDF, we can only talk about resources And literals, but literals are where a graph ends (no out edges) Munindar P. Singh (NCSU) Service-Oriented Computing Fall

15 Reification of Statements Reify: to make referenceable, essential for quoting statements to Agree or disagree with them Assert modalities: possible, desirable,... Make a statement into a resource; then talk about it rdf:statement is a class the given statement s rdf:type is rdf:statement rdf:statement defines important properties: rdf:subject, rdf:object, and rdf:predicate Munindar P. Singh (NCSU) Service-Oriented Computing Fall

16 Reification Exercise Produce a model using RDF and RDF Schema of the following assertions: (a) Statement (b) is false (b) Statement (a) is true Express your solution as a graph with suitable annotations Notation Resources: solid ellipses Properties (hence, also resources): dashed ellipses Literals: rectangles Definitions Two resources named true and false Property: is Munindar P. Singh (NCSU) Service-Oriented Computing Fall

17 Reification Exercise Solution Problem-specific constructs: (a), (b), True, False, hasname is Generic: everything else Statement type type subject (a) (b) subject object predicate predicate object false hasname False is True hasname true Munindar P. Singh (NCSU) Service-Oriented Computing Fall

18 RDF Summary RDF captures deeper structure than XML RDF captures graphs in general Meaning depends on the graph, not the document that represents a graph RDF is based on an simple linguistic representation: subject, predicate, object But webified via URIs RDF comes prepackaged with RDF Schema In essence, an object-oriented type system: a vocabulary to create new vocabularies, such as Friend of a Friend (FOAF) Dublin Core Mozilla extensions Provides a basis for OWL (next topic) Munindar P. Singh (NCSU) Service-Oriented Computing Fall

A note on the history of the document: RDF Formalization, by Draltan Marin

A note on the history of the document: RDF Formalization, by Draltan Marin A note on the history of the document: RDF Formalization, by Draltan Marin Claudio Gutierrez Computer Science Department, Universidad de Chile Santiago de Chile, May 2006 Draltan Marin, in 2004 a student

More information

Minimal Deductive Systems for RDF

Minimal Deductive Systems for RDF Minimal Deductive Systems for RDF Sergio Muñoz, Jorge Pérez, Claudio Gutierrez Department of Computer Science Universidad de Chile Pontificia Universidad Católica de Chile Center for Web Research http://www.cwr.cl

More information

Annotation algebras for RDFS

Annotation algebras for RDFS University of Edinburgh Semantic Web in Provenance Management, 2010 RDF definition U a set of RDF URI references (s, p, o) U U U an RDF triple s subject p predicate o object A finite set of triples an

More information

Web Ontology Language (OWL)

Web Ontology Language (OWL) Web Ontology Language (OWL) Need meaning beyond an object-oriented type system RDF (with RDFS) captures the basics, approximating an object-oriented type system OWL provides some of the rest OWL standardizes

More information

I4-DX2 RDF Querying in Xcerpt

I4-DX2 RDF Querying in Xcerpt I4-DX2 RDF Querying in Xcerpt Project title: Reasoning on the Web with Rules and Semantics Project acronym: REWERSE Project number: IST-2004-506779 Project instrument: EU FP6 Network of Excellence (NoE)

More information

Semantic Web Languages Towards an Institutional Perspective

Semantic Web Languages Towards an Institutional Perspective Semantic Web Languages Towards an Institutional Perspective Dorel Lucanu 1,YuanFangLi 2, and Jin Song Dong 2 1 Faculty of Computer Science A.I.Cuza University Iaşi, Romania dlucanu@info.uaic.ro 2 School

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of

More information

Extended RDF as a Semantic Foundation of Rule Markup Languages

Extended RDF as a Semantic Foundation of Rule Markup Languages Journal of Artificial Intelligence Research (2008) Submitted 3/06; published /08 Extended RDF as a Semantic Foundation of Rule Markup Languages Anastasia Analyti Institute of Computer Science, FORTH-ICS,

More information

Semantic Matching for Stream Reasoning

Semantic Matching for Stream Reasoning Institutionen för Datavetenskap Department of Computer and Information Science Master s thesis Semantic Matching for Stream Reasoning by Zlatan Dragisic LIU-IDA/LITH-EX-A 11/041 SE 2011-10-03 Linköpings

More information

A Survey of Temporal Knowledge Representations

A Survey of Temporal Knowledge Representations A Survey of Temporal Knowledge Representations Advisor: Professor Abdullah Tansel Second Exam Presentation Knowledge Representations logic-based logic-base formalisms formalisms more complex and difficult

More information

Query Processing on RDF data

Query Processing on RDF data Query Processing on RDF data Hai Huang B.E. (HFUT, China) M.E. (IIM of CAS, China) A dissertation submitted to the Faculty of Information and Communication Technologies Swinburne University of Technology

More information

Semantic Web SPARQL. Gerd Gröner, Matthias Thimm. July 16,

Semantic Web SPARQL. Gerd Gröner, Matthias Thimm. July 16, Semantic Web SPARQL Gerd Gröner, Matthias Thimm {groener,thimm}@uni-koblenz.de Institute for Web Science and Technologies (WeST) University of Koblenz-Landau July 16, 2013 Gerd Gröner, Matthias Thimm Semantic

More information

Lecture 2: Axiomatic semantics

Lecture 2: Axiomatic semantics Chair of Software Engineering Trusted Components Prof. Dr. Bertrand Meyer Lecture 2: Axiomatic semantics Reading assignment for next week Ariane paper and response (see course page) Axiomatic semantics

More information

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only

Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only 1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the

More information

Geospatial Semantics for Topographic Data

Geospatial Semantics for Topographic Data Geospatial Semantics for Topographic Data E. Lynn Usery U.S. Geological Survey Abstract. Whereas The National Map of the U.S. Geological Survey is based on data models and processes of geographic information

More information

314 Index. base interpretation, 50 base URI, 61 bottom concept, 43

314 Index. base interpretation, 50 base URI, 61 bottom concept, 43 Index AAT. See Art & Architecture Thesaurus (AAT) ABox. See assertional knowledge ACL. See Agent Communication Language (ACL) ADL. See Alexandria Digital Library (ADL) Adobe Extensible Metadata Platform,

More information

BGP Query Answering against Dynamic RDF Databases

BGP Query Answering against Dynamic RDF Databases BGP Query Answering against Dynamic RDF Databases François Goasdoué, Ioana Manolescu, Alexandra Roatis To cite this version: François Goasdoué, Ioana Manolescu, Alexandra Roatis. BGP Query Answering against

More information

Lecture 4: Proposition, Connectives and Truth Tables

Lecture 4: Proposition, Connectives and Truth Tables Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine

More information

Knowledge Sharing. A conceptualization is a map from the problem domain into the representation. A conceptualization specifies:

Knowledge Sharing. A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying

More information

Logic. Readings: Coppock and Champollion textbook draft, Ch

Logic. Readings: Coppock and Champollion textbook draft, Ch Logic Readings: Coppock and Champollion textbook draft, Ch. 3.1 3 1. Propositional logic Propositional logic (a.k.a propositional calculus) is concerned with complex propositions built from simple propositions

More information

Model-theoretic Semantics

Model-theoretic Semantics Model-theoretic Semantics 1 Semantics Intro I What is the semantics of the following statement, according to RDF and according to RDFS? Ex:SpaceAccessory rdfs:subclassof ex:product 2 Semantics Intro II

More information

CM10196 Topic 2: Sets, Predicates, Boolean algebras

CM10196 Topic 2: Sets, Predicates, Boolean algebras CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection

More information

C. Modal Propositional Logic (MPL)

C. Modal Propositional Logic (MPL) C. Modal Propositional Logic (MPL) Let s return to a bivalent setting. In this section, we ll take it for granted that PL gets the semantics and logic of and Ñ correct, and consider an extension of PL.

More information

APPLICATION OF ONTOLOGIES AND SEMANTIC WEB FOR FACILITATION OF ECOLOGY

APPLICATION OF ONTOLOGIES AND SEMANTIC WEB FOR FACILITATION OF ECOLOGY Доклади на Българската академия на науките Comptes rendus de l Académie bulgare des Sciences Tome 65, No 5, 2012 MATHEMATIQUES Informatique APPLICATION OF ONTOLOGIES AND SEMANTIC WEB FOR FACILITATION OF

More information

Lecture Notes on Inductive Definitions

Lecture Notes on Inductive Definitions Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 28, 2003 These supplementary notes review the notion of an inductive definition and give

More information

Logic. Propositional Logic: Syntax

Logic. Propositional Logic: Syntax Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

RDF and Logic: Reasoning and Extension

RDF and Logic: Reasoning and Extension RDF and Logic: Reasoning and Extension Jos de Bruijn Faculty of Computer Science, Free University of Bozen-Bolzano, Italy debruijn@inf.unibz.it Stijn Heymans Digital Enterprise Research Institute (DERI),

More information

2 A not-quite-argument for X-bar structure in noun phrases

2 A not-quite-argument for X-bar structure in noun phrases CAS LX 321 / GRS LX 621 Syntax: Introduction to Sentential Structure ovember 16, 2017 1 and pronouns (1) he linguists yodel. (2) We linguists yodel. (3) hey looked at us linguists. (4) hey looked at linguists.

More information

Incomplete Information in RDF

Incomplete Information in RDF Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens

More information

Lecture Notes on Inductive Definitions

Lecture Notes on Inductive Definitions Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 September 2, 2004 These supplementary notes review the notion of an inductive definition and

More information

GeomRDF : A Geodata Converter with a Fine-Grained Structured Representation of Geometry in the Web

GeomRDF : A Geodata Converter with a Fine-Grained Structured Representation of Geometry in the Web GeomRDF : A Geodata Converter with a Fine-Grained Structured Representation of Geometry in the Web Fayçal Hamdi 1 Nathalie Abadie 2 Bénédicte Bucher 2 Abdelfettah Feliachi 2 1 ISID TEAM, CEDRIC Lab Conservatoire

More information

Categorial Grammar. Larry Moss NASSLLI. Indiana University

Categorial Grammar. Larry Moss NASSLLI. Indiana University 1/37 Categorial Grammar Larry Moss Indiana University NASSLLI 2/37 Categorial Grammar (CG) CG is the tradition in grammar that is closest to the work that we ll do in this course. Reason: In CG, syntax

More information

Time Zones - KET Grammar

Time Zones - KET Grammar Inventory of grammatical areas Verbs Regular and irregular forms Pages 104-105 (Unit 1 Modals can (ability; requests; permission) could (ability; polite requests) Page 3 (Getting Started) Pages 45-47,

More information

Natural Logic Welcome to the Course!

Natural Logic Welcome to the Course! 1/31 Natural Logic Welcome to the Course! Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/31 This course presents logical systems tuned to natural language The raison d être of logic

More information

Graphical Models for Text Mining: Knowledge Extraction and Performance Estimation

Graphical Models for Text Mining: Knowledge Extraction and Performance Estimation UNIVERSITÀ DEGLI STUDI DI MILANO - BICOCCA Facoltà di Scienze Matematiche, Fisiche e Naturali Dipartimento di Informatica Sistemistica e Comunicazione Dottorato di Ricerca in Informatica - XXIII Ciclo

More information

Comp487/587 - Boolean Formulas

Comp487/587 - Boolean Formulas Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested

More information

Propositional Logic: Syntax

Propositional Logic: Syntax Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic

More information

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning. 3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on

More information

Inductive Definitions with Inference Rules 1 / 27

Inductive Definitions with Inference Rules 1 / 27 Inductive Definitions with Inference Rules 1 / 27 Outline Introduction Specifying inductive definitions Inference rules in action Judgments, axioms, and rules Reasoning about inductive definitions Direct

More information

Introduction to Semantics. The Formalization of Meaning 1

Introduction to Semantics. The Formalization of Meaning 1 The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions

More information

Lecture 7. Logic. Section1: Statement Logic.

Lecture 7. Logic. Section1: Statement Logic. Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement

More information

(NB. Pages are intended for those who need repeated study in formal languages) Length of a string. Formal languages. Substrings: Prefix, suffix.

(NB. Pages are intended for those who need repeated study in formal languages) Length of a string. Formal languages. Substrings: Prefix, suffix. (NB. Pages 22-40 are intended for those who need repeated study in formal languages) Length of a string Number of symbols in the string. Formal languages Basic concepts for symbols, strings and languages:

More information

Approximation and Relaxation of Semantic Web Path Queries

Approximation and Relaxation of Semantic Web Path Queries *Manuscript Click here to view linked References Approximation and Relaxation of Semantic Web Path Queries Alexandra Poulovassilis a, Petra Selmer a, Peter T. Wood a a Knowledge Lab, Department of Computer

More information

Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach

Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach Boris Motik a a Oxford University Computing Laboratory, Oxford, UK Abstract RDF(S) and OWL 2 can currently represent only

More information

Linguistics and logic of common mathematical language I. Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn

Linguistics and logic of common mathematical language I. Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn The NAPROCHE Project Linguistics and logic of common mathematical language I Peter Koepke and Merlin Carl, Mathematical Institute Universität Bonn Mathematical texts are formulated in a semi-formal language,

More information

Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop

Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop Hestenes lectures, Part 5. Summer 1997 at ASU to 50 teachers in their 3 rd Modeling Workshop WHAT DO WE TEACH? The question What do we teach? has to do with What do we want to learn? A common instructional

More information

Logic. Propositional Logic: Syntax. Wffs

Logic. Propositional Logic: Syntax. Wffs Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

Relational Reasoning in Natural Language

Relational Reasoning in Natural Language 1/67 Relational Reasoning in Natural Language Larry Moss ESSLLI 10 Course on Logics for Natural Language Inference August, 2010 Adding transitive verbs the work on R, R, and other systems is joint with

More information

Ling 5801: Lecture Notes 7 From Programs to Context-Free Grammars

Ling 5801: Lecture Notes 7 From Programs to Context-Free Grammars Ling 5801: Lecture otes 7 From Programs to Context-Free rammars 1. The rules we used to define programs make up a context-free grammar A Context-Free rammar is a tuple C,X,S,R, where: C is a finite set

More information

Ling 130 Notes: Syntax and Semantics of Propositional Logic

Ling 130 Notes: Syntax and Semantics of Propositional Logic Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating

More information

First Order Logic (FOL)

First Order Logic (FOL) First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter

More information

CS 188 Introduction to AI Fall 2005 Stuart Russell Final

CS 188 Introduction to AI Fall 2005 Stuart Russell Final NAME: SID#: Section: 1 CS 188 Introduction to AI all 2005 Stuart Russell inal You have 2 hours and 50 minutes. he exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON HE EXAM

More information

Topic 1: Propositional logic

Topic 1: Propositional logic Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements

More information

Axiomatic Semantics. Lecture 9 CS 565 2/12/08

Axiomatic Semantics. Lecture 9 CS 565 2/12/08 Axiomatic Semantics Lecture 9 CS 565 2/12/08 Axiomatic Semantics Operational semantics describes the meaning of programs in terms of the execution steps taken by an abstract machine Denotational semantics

More information

Reasoning About Imperative Programs. COS 441 Slides 10b

Reasoning About Imperative Programs. COS 441 Slides 10b Reasoning About Imperative Programs COS 441 Slides 10b Last time Hoare Logic: { P } C { Q } Agenda If P is true in the initial state s. And C in state s evaluates to s. Then Q must be true in s. Program

More information

Knowledge Representation and Description Logic Part 3

Knowledge Representation and Description Logic Part 3 Knowledge Representation and Description Logic Part 3 Renata Wassermann renata@ime.usp.br Computer Science Department University of São Paulo September 2014 IAOA School Vitória Renata Wassermann Knowledge

More information

SPARQL Rewriting for Query Mediation over Mapped Ontologies

SPARQL Rewriting for Query Mediation over Mapped Ontologies SPARQL Rewriting for Query Mediation over Mapped Ontologies Konstantinos Makris*, Nektarios Gioldasis*, Nikos Bikakis**, Stavros Christodoulakis* *Laboratory of Distributed Multimedia Information Systems

More information

Text and multimedia languages and properties

Text and multimedia languages and properties Text and multimedia languages and properties (Modern IR, Ch. 6) I VP R 1 Introduction Metadata Text Markup Languages Multimedia Trends and Research Issues Bibliographical Discussion I VP R 2 Introduction

More information

Models of Computation,

Models of Computation, Models of Computation, 2010 1 Induction We use a lot of inductive techniques in this course, both to give definitions and to prove facts about our semantics So, it s worth taking a little while to set

More information

A conceptualization is a map from the problem domain into the representation. A conceptualization specifies:

A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying

More information

Propositional Logic Review

Propositional Logic Review Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining

More information

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1

Introduction to Semantics. Common Nouns and Adjectives in Predicate Position 1 Common Nouns and Adjectives in Predicate Position 1 (1) The Lexicon of Our System at Present a. Proper Names: [[ Barack ]] = Barack b. Intransitive Verbs: [[ smokes ]] = [ λx : x D e. IF x smokes THEN

More information

Follow links for Class Use and other Permissions. For more information send to:

Follow links for Class Use and other Permissions. For more information send  to: COPYRIGHT NOTICE: John J. Watkins: Topics in Commutative Ring Theory is published by Princeton University Press and copyrighted, 2007, by Princeton University Press. All rights reserved. No part of this

More information

CS1800: Strong Induction. Professor Kevin Gold

CS1800: Strong Induction. Professor Kevin Gold CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too

More information

Chapter 9. Modal Language, Syntax, and Semantics

Chapter 9. Modal Language, Syntax, and Semantics Chapter 9 Modal Language, Syntax, and Semantics In chapter 6 we saw that PL is not expressive enough to represent valid arguments and semantic relationships that employ quantified expressions some and

More information

Logic: The Big Picture

Logic: The Big Picture Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving

More information

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will

More information

CMPSCI 601: Tarski s Truth Definition Lecture 15. where

CMPSCI 601: Tarski s Truth Definition Lecture 15. where @ CMPSCI 601: Tarski s Truth Definition Lecture 15! "$#&%(') *+,-!".#/%0'!12 43 5 6 7 8:9 4; 9 9 < = 9 = or 5 6?>A@B!9 2 D for all C @B 9 CFE where ) CGE @B-HI LJKK MKK )HG if H ; C if H @ 1 > > > Fitch

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Defining a water quality vocabulary using QUDT and ChEBI

Defining a water quality vocabulary using QUDT and ChEBI Defining a water quality vocabulary using QUDT and ChEBI B.A. Simons a, J. Yu a, & S.J.D. Cox a a CSIRO Land and Water Email: bruce.simons@csiro.au Abstract: Vocabularies of observed properties and associated

More information

Basic Dublin Core Semantics

Basic Dublin Core Semantics Basic Dublin Core Semantics DC 2006 Tutorial 1, 3 October 2006 Marty Kurth Head of Metadata Services Cornell University Library Getting started Let s introduce ourselves Let s discuss our expectations

More information

Complexity and NP-completeness

Complexity and NP-completeness Lecture 17 Complexity and NP-completeness Supplemental reading in CLRS: Chapter 34 As an engineer or computer scientist, it is important not only to be able to solve problems, but also to know which problems

More information

A* Search. 1 Dijkstra Shortest Path

A* Search. 1 Dijkstra Shortest Path A* Search Consider the eight puzzle. There are eight tiles numbered 1 through 8 on a 3 by three grid with nine locations so that one location is left empty. We can move by sliding a tile adjacent to the

More information

Schema Free Querying of Semantic Data. by Lushan Han

Schema Free Querying of Semantic Data. by Lushan Han Schema Free Querying of Semantic Data by Lushan Han Thesis submitted to the Faculty of the Graduate School of the University of Maryland in partial fulfillment of the requirements for the degree of PhD

More information

DBpedia Ontology Enrichment for Inconsistency Detection and Statistical Schema Induction

DBpedia Ontology Enrichment for Inconsistency Detection and Statistical Schema Induction DBpedia Ontology Enrichment for Inconsistency Detection and Statistical Schema Induction Presentation By Tung Do 1. Statistical Schema Induction 2. DBpedia Ontology Enrichment for Inconsistency Detection

More information

Lecture Notes: Axiomatic Semantics and Hoare-style Verification

Lecture Notes: Axiomatic Semantics and Hoare-style Verification Lecture Notes: Axiomatic Semantics and Hoare-style Verification 17-355/17-665/17-819O: Program Analysis (Spring 2018) Claire Le Goues and Jonathan Aldrich clegoues@cs.cmu.edu, aldrich@cs.cmu.edu It has

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information

Languages. Languages. An Example Grammar. Grammars. Suppose we have an alphabet V. Then we can write:

Languages. Languages. An Example Grammar. Grammars. Suppose we have an alphabet V. Then we can write: Languages A language is a set (usually infinite) of strings, also known as sentences Each string consists of a sequence of symbols taken from some alphabet An alphabet, V, is a finite set of symbols, e.g.

More information

Predicate Calculus - Syntax

Predicate Calculus - Syntax Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language

More information

CS558 Programming Languages

CS558 Programming Languages CS558 Programming Languages Winter 2017 Lecture 2b Andrew Tolmach Portland State University 1994-2017 Semantics Informal vs. Formal Informal semantics Descriptions in English (or other natural language)

More information

6.001 Recitation 22: Streams

6.001 Recitation 22: Streams 6.001 Recitation 22: Streams RI: Gerald Dalley, dalleyg@mit.edu, 4 May 2007 http://people.csail.mit.edu/dalleyg/6.001/sp2007/ The three chief virtues of a programmer are: Laziness, Impatience and Hubris

More information

Proposition Knowledge Graphs. Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel

Proposition Knowledge Graphs. Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel Proposition Knowledge Graphs Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel 1 Problem End User 2 Case Study: Curiosity (Mars Rover) Curiosity is a fully equipped lab. Curiosity is a rover.

More information

Theory of Computation

Theory of Computation Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.

More information

OWL Semantics COMP Sean Bechhofer Uli Sattler

OWL Semantics COMP Sean Bechhofer Uli Sattler OWL Semantics COMP62342 Sean Bechhofer sean.bechhofer@manchester.ac.uk Uli Sattler uli.sattler@manchester.ac.uk 1 Toward Knowledge Formalization Acquisition Process Elicit tacit knowledge A set of terms/concepts

More information

APPROVAL SHEET. Uncertainty in Semantic Web. Doctor of Philosophy, 2005

APPROVAL SHEET. Uncertainty in Semantic Web. Doctor of Philosophy, 2005 APPROVAL SHEET Title of Dissertation: BayesOWL: A Probabilistic Framework for Uncertainty in Semantic Web Name of Candidate: Zhongli Ding Doctor of Philosophy, 2005 Dissertation and Abstract Approved:

More information

ECS 20: Discrete Mathematics for Computer Science UC Davis Phillip Rogaway June 12, Final Exam

ECS 20: Discrete Mathematics for Computer Science UC Davis Phillip Rogaway June 12, Final Exam ECS 20: Discrete Mathematics for Computer Science Handout F UC Davis Phillip Rogaway June 12, 2000 Final Exam Instructions: Read the questions carefully; maybe I m not asking what you assume me to be asking!

More information

CHAPTER THREE: RELATIONS AND FUNCTIONS

CHAPTER THREE: RELATIONS AND FUNCTIONS CHAPTER THREE: RELATIONS AND FUNCTIONS 1 Relations Intuitively, a relation is the sort of thing that either does or does not hold between certain things, e.g. the love relation holds between Kim and Sandy

More information

X-bar theory. X-bar :

X-bar theory. X-bar : is one of the greatest contributions of generative school in the filed of knowledge system. Besides linguistics, computer science is greatly indebted to Chomsky to have propounded the theory of x-bar.

More information

CSC 7101: Programming Language Structures 1. Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11.

CSC 7101: Programming Language Structures 1. Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11. Axiomatic Semantics Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 1 Overview We ll develop proof rules, such as: { I b } S { I } { I } while b do S end { I b } That allow us to verify

More information

Lecture 13: Soundness, Completeness and Compactness

Lecture 13: Soundness, Completeness and Compactness Discrete Mathematics (II) Spring 2017 Lecture 13: Soundness, Completeness and Compactness Lecturer: Yi Li 1 Overview In this lecture, we will prvoe the soundness and completeness of tableau proof system,

More information

An OWL Ontology for Quantum Mechanics

An OWL Ontology for Quantum Mechanics An OWL Ontology for Quantum Mechanics Marcin Skulimowski Faculty of Physics and Applied Informatics, University of Lodz Pomorska 149/153, 90-236 Lodz, Poland mskulim@uni.lodz.pl Abstract. An OWL ontology

More information

Conjunctive Normal Form and SAT

Conjunctive Normal Form and SAT Notes on Satisfiability-Based Problem Solving Conjunctive Normal Form and SAT David Mitchell mitchell@cs.sfu.ca October 4, 2015 These notes are a preliminary draft. Please use freely, but do not re-distribute

More information

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University

Continuations in Type Logical Grammar. Grafting Trees: (with Chris Barker, UCSD) NJPLS, 27 February Harvard University Grafting Trees: Continuations in Type Logical Grammar Chung-chieh Shan Harvard University ccshan@post.harvard.edu (with Chris Barker, UCSD) NJPLS, 27 February 2004 Computational Linguistics 1 What a linguist

More information

TDDD08 Tutorial 1. Who? From? When? 6 september Victor Lagerkvist (& Wªodek Drabent)

TDDD08 Tutorial 1. Who? From? When? 6 september Victor Lagerkvist (& Wªodek Drabent) TDDD08 Tutorial 1 Who? From? Victor Lagerkvist (& Wªodek Drabent) Theoretical Computer Science Laboratory, Linköpings Universitet, Sweden When? 6 september 2015 1 / 18 Preparations Before you start with

More information

Propositional Logic. Fall () Propositional Logic Fall / 30

Propositional Logic. Fall () Propositional Logic Fall / 30 Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically

More information

Context Free Grammars

Context Free Grammars Automata and Formal Languages Context Free Grammars Sipser pages 101-111 Lecture 11 Tim Sheard 1 Formal Languages 1. Context free languages provide a convenient notation for recursive description of languages.

More information

Ling 98a: The Meaning of Negation (Week 5)

Ling 98a: The Meaning of Negation (Week 5) Yimei Xiang yxiang@fas.harvard.edu 15 October 2013 1 Review Negation in propositional logic, oppositions, term logic of Aristotle Presuppositions Projection and accommodation Three-valued logic External/internal

More information

In this chapter, we specify a deductive apparatus for PL.

In this chapter, we specify a deductive apparatus for PL. Handout 5 PL Derivations In this chapter, we specify a deductive apparatus for PL Definition deductive apparatus A deductive apparatus for PL is a set of rules of inference (or derivation rules) that determine

More information

Midterm sample questions

Midterm sample questions Midterm sample questions CS 585, Brendan O Connor and David Belanger October 12, 2014 1 Topics on the midterm Language concepts Translation issues: word order, multiword translations Human evaluation Parts

More information