Web Ontology Language (OWL)

Size: px
Start display at page:

Download "Web Ontology Language (OWL)"

Transcription

1 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 constructs to capture such subtleties of meaning OWL builds on RDF, by limiting it Limiting syntax Limiting possible interpretations OWL assigns standard semantics to new terms Munindar P. Singh (NCSU) Service-Oriented Computing Fall

2 OWL in Brief Specifies classes and properties in description logic (DL) Class operators analogous to Boolean operators and, not, and or Constraints on properties: transitive,... Restrictions: constructs unique to DL OWL 1 has Species or Dialects OWL Full OWL DL OWL Lite Munindar P. Singh (NCSU) Service-Oriented Computing Fall

3 Custom Metadata Vocabularies Metadata for services and information resources presupposes custom vocabularies Need standard semantics for the metadata to remove ambiguity despite heterogeneity <Mammal r d f : ID= Mary /> <Mammal r d f : ID= John > <h a s P a r e n t r d f : r e s o u r c e = #Mary /> </Mammal> Munindar P. Singh (NCSU) Service-Oriented Computing Fall

4 Ontologies to Define Vocabulary Semantics Example of a trivial ontology defining our vocabulary Uses simple subclasses and properties Disjointness goes beyond RDF Object properties refine RDF properties; relate two objects <o w l : C l a s s r d f : I D= Mammal > <r d f s : s u b C l a s s O f r d f : r e s o u r c e= #Animal /> <o w l : d i s j o i n t W i t h r d f : r e s o u r c e= #R e p t i l e /> </ o w l : C l a s s> <o w l : O b j e c t P r o p e r t y r d f : I D= h a s P a r e n t > <r d f s : d o m a i n r d f : r e s o u r c e= #Animal /> <r d f s : r a n g e r d f : r e s o u r c e= #Animal /> </ o w l : O b j e c t P r o p e r t y> Munindar P. Singh (NCSU) Service-Oriented Computing Fall

5 Simple Inference Find a model, if any exists Given the definition for the property hasparent and the snippet <owl : Thing r d f : ID= Fido > <h a s P a r e n t r d f : r e s o u r c e= #Rover /> </owl : Thing> we can infer that Fido is an Animal Munindar P. Singh (NCSU) Service-Oriented Computing Fall

6 OWL Entities and Relationships Illustrative as a summary: not a proper OWL diagram rdfs:subclassof rdfs:class owlequivalentclass owl:equivalentproperty owl:subpropertyof owl:class owl:datatypeproperty rdf:range owl:datarange owl:disjointwith rdf:domain owl:equivalentproperty rdf:range rdf:property rdfs:datatype owl:inverseof owl:objectproperty owl:functionalproperty owl:subpropertyof owl:inversefunctionalproperty owl:symmetricproperty owl:transitiveproperty Munindar P. Singh (NCSU) Service-Oriented Computing Fall

7 Constructing OWL Classes Explicitly <owl : C l a s s r d f : ID= Mammal > <r d f s : s u b C l a s s O f r d f : r e s o u r c e= #Animal /> <owl : d i s j o i n t W i t h r d f : r e s o u r c e= #R e p t i l e /> </owl : C l a s s > Anonymously via formal expressions using operators analogous to set operators: intersectionof, unionof, complementof <owl : C l a s s r d f : ID= SugaryBread > <owl : i n t e r s e c t i o n O f r d f : parsetype = C o l l e c t i o n > <owl : C l a s s r d f : about= #Bread /> <owl : C l a s s r d f : about= #SweetFood /> </owl : i n t e r s e c t i o n O f > </owl : C l a s s > Munindar P. Singh (NCSU) Service-Oriented Computing Fall

8 Restrictions Conceptually A unique feature of description logics Analogous to division in arithmetic: define classes in terms of a restriction that they satisfy with respect to a given property Anonymous: typically included in a class def to enable referring them Key primitives are somevaluesfrom a specified class allvaluesfrom a specified class hasvalue equal to a specified individual or data type mincardinality maxcardinality cardinality (when maxcardinality equals mincardinality) Munindar P. Singh (NCSU) Service-Oriented Computing Fall

9 Examples of Restrictions: 1 <owl : R e s t r i c t i o n > <owl : o n P r o p e r t y r d f : r e s o u r c e= #h a s F a t h e r /> <owl : m a x C a r d i n a l i t y r d f : d a t a t y p e= xsd : n o n N e g a t i v e I n t e g e r > 1 </owl : m a x C a r d i n a l i t y > </owl : R e s t r i c t i o n > <owl : R e s t r i c t i o n > <owl : o n P r o p e r t y r d f : r e s o u r c e = #bakes /> <owl : somevaluesfrom r d f : r e s o u r c e = #Bread /> </owl : R e s t r i c t i o n > Munindar P. Singh (NCSU) Service-Oriented Computing Fall

10 Examples of Restrictions: 2 The maker of a Wine must be a Winery The allvaluesfrom restriction is on the hasmaker property of this Wine class (Makers of other products such as cheese are not constrained by this local restriction) <owl : C l a s s r d f : ID= Wine > <r d f s : s u b C l a s s O f r d f : r e s o u r c e= &food ; P o t a b l e L i q u i d /> <r d f s : s u b C l a s s O f > <owl : R e s t r i c t i o n > <owl : o n P r o p e r t y r d f : r e s o u r c e= #hasmaker /> <owl : a l l V a l u e s F r o m r d f : r e s o u r c e= #Winery /> </owl : R e s t r i c t i o n > </ r d f s : s u b C l a s s O f >... </owl : C l a s s > Munindar P. Singh (NCSU) Service-Oriented Computing Fall

11 Axioms Conceptually Assertions that are given to be true Can be especially powerful in combination with other axioms, which may come from different documents Some primitives rdfs:subclassof owl:equivalentclass Munindar P. Singh (NCSU) Service-Oriented Computing Fall

12 Examples of Axioms <owl : A l l D i f f e r e n t > <! i n e s s e n c e, p a i r w i s e i n e q u a l i t i e s > <owl : d i s t i n c t M e m b e r s r d f : parsetype = C o l l e c t i o n > <ex : Country r d f : ID= I n d i a /> <ex : Country r d f : ID= R u s s i a /> <ex : Country r d f : ID= USA /> <owl : d i s t i n c t M e m b e r s/> </owl : A l l D i f f e r e n t > <ex : Country r d f : ID= I r a n /> <ex : Country r d f : ID= P e r s i a > <owl : s a m e I n d i v i d u a l A s r d f : r e s o u r c e = #I r a n /> </ex : Country> Munindar P. Singh (NCSU) Service-Oriented Computing Fall

13 Restrictions versus Axioms Axioms are global assertions that can be used as the basis for further inference Restrictions are constructors A restriction on hasfather of maxcardinality of 1 Does not mean all animals have zero or one fathers Means the class of animals who have zero or one fathers: this class may or may not have any instances Often, to achieve the desired effect, we would have to combine restrictions with axioms (such as based on equivalentclass), e.g., A restriction on hasfather of maxcardinality of 1 An axiom asserting this restriction is equivalent to Animal Munindar P. Singh (NCSU) Service-Oriented Computing Fall

14 Inference Like RDF, OWL is about meaning, not syntax Statements from different documents about the same URI are automatically conjoined OWL can be surprising to the uninitiated Integrity constraint: no one can have more than one mother Declare a fact: Mary is John s mother Declare a fact: Jane is John s mother What will you conclude? A traditional DBMS would declare an integrity violation An OWL reasoner would say Mary = Jane Munindar P. Singh (NCSU) Service-Oriented Computing Fall

15 Dialects Compared OWL DL Core dialect, includes DL primitives Not necessarily (but often) tractable OWL Lite Limits OWL DL constructs to ensure tractability No disjointwith, complementof, unionof, hasvalue Enumeration (oneof) intersectionof only for two or more class names or restrictions equivalentclass: class names to names or restrictions rdfs:subclassof: class names to names or restrictions allvaluesfrom and somevaluesfrom: to class names or datatype names rdf:type: to class names or restrictions rdf:domain: class names rdf:range: to class names or datatype names OWL Full Extremely general: allows all RDF syntax Potentially intractable (undecidable) Supports fancy expressiveness needs and introducing new concepts into the standard

16 Expressiveness Limitations: 1 OWL DL cannot express some simple requirements Non-tree models: because instance variables are implicit in OWL restrictions, OWL cannot express conditions that require that two variables be identified Think of siblings two people who have the same parents but in terms of classes Do the same thing with class definitions Munindar P. Singh (NCSU) Service-Oriented Computing Fall

17 Expressiveness Limitations: 2 Specialized properties Cannot state that the child of a mammal must be a mammal and so on, without Defining new child properties for each class Adding an axiom for each class stating that it is a subclassof the restriction of haschild to itself Analogous to the problem in a strongly typed object-oriented language without generics You have to typecast the contents of a hash table or linked list Munindar P. Singh (NCSU) Service-Oriented Computing Fall

18 Expressiveness Limitations: 3 Constraints among individuals and defeasibility Constraints among individuals Can define ETHusband: class of persons who have been married to Elizabeth Taylor Cannot define tall person: class of persons whose height is above a certain threshold Cannot capture defeasibility (also known as nonmonotonicity) Birds fly Penguins are birds Penguins don t fly Munindar P. Singh (NCSU) Service-Oriented Computing Fall

19 OWL Summary OWL builds on RDF to provide a rich vocabulary for capturing knowledge Synthesizes a lot of excellent work on discrete, taxonomic knowledge representation Fits well with describing information resources a basis for describing metadata vocabularies Critical for unambiguously describing services so they can be selected and suitably engaged Munindar P. Singh (NCSU) Service-Oriented Computing Fall

20 Modeling Exercise Student (S); faculty member (F); regular faculty member (R); department (D); thesis committee (T) An S belongs to exactly one D An R is an F An R advises zero or more Ss An F is affiliated with one or more Ds An S is advised by exactly one R An S is evaluated by exactly one T A T evaluates exactly one S A T has three or more Fs as its members Exactly one of the members of a T is its chair, who is an R Munindar P. Singh (NCSU) Service-Oriented Computing Fall

Description Logics. decidable, supported by automatic reasoning systems

Description Logics. decidable, supported by automatic reasoning systems Description logics Description Logics q A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems q Used for modelling of application domains q Classification of concepts

More information

Description logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox

Description logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox Description Logics Description logics A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems Used for modelling of application domains Classification of concepts and

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

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

FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES

FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES OWL & Description Logics Markus Krötzsch Dresden, 16 May 2014 Content Overview & XML Introduction into RDF RDFS Syntax & Intuition Tutorial 1 RDFS Semantics RDFS

More information

OWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology

OWL Basics. Technologies for the Semantic Web. Building a Semantic Web. Ontology Technologies for the Semantic Web OWL Basics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk Metadata Resources are marked-up with descriptions of their content. No good

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

OWL Semantics. COMP60421 Sean Bechhofer University of Manchester

OWL Semantics. COMP60421 Sean Bechhofer University of Manchester OWL Semantics COMP60421 Sean Bechhofer University of Manchester sean.bechhofer@manchester.ac.uk 1 Technologies for the Semantic Web Metadata Resources are marked-up with descriptions of their content.

More information

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

Resource Description Framework (RDF) A basis for knowledge representation on the Web 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

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

ALOE A Graphical Editor for OWL Ontologies

ALOE A Graphical Editor for OWL Ontologies ALOE A Graphical Editor for OWL Ontologies Masterarbeit der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von Daria Spescha 2005 Leiter der Arbeit: Prof. Dr. Gerhard Jäger,

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

INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION

INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION By Jiao Tao A Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for

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

Knowledge Representation and Description Logic Part 2

Knowledge Representation and Description Logic Part 2 Knowledge Representation and Description Logic Part 2 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

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

Logic and Reasoning in the Semantic Web (part II OWL)

Logic and Reasoning in the Semantic Web (part II OWL) Logic and Reasoning in the Semantic Web (part II OWL) Fulvio Corno, Laura Farinetti Politecnico di Torino Dipartimento di Automatica e Informatica e-lite Research Group http://elite.polito.it Outline Reasoning

More information

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

Week 4. COMP62342 Sean Bechhofer, Uli Sattler Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau

More information

Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure

Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure by Jeffrey Pound A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree

More information

Description Logics. Adrian Groza. Department of Computer Science Technical University of Cluj-Napoca

Description Logics. Adrian Groza. Department of Computer Science Technical University of Cluj-Napoca Description Logics Adrian Groza Department of Computer Science Technical University of Cluj-Napoca Outline 1 The World as a Graph 2 Description Logics Family Ontology Description Logics How far can we

More information

ALC Concept Learning with Refinement Operators

ALC Concept Learning with Refinement Operators ALC Concept Learning with Refinement Operators Jens Lehmann Pascal Hitzler June 17, 2007 Outline 1 Introduction to Description Logics and OWL 2 The Learning Problem 3 Refinement Operators and Their Properties

More information

Principles of Knowledge Representation and Reasoning

Principles of Knowledge Representation and Reasoning Principles of Knowledge Representation and Semantic Networks and Description Logics II: Description Logics Terminology and Notation Bernhard Nebel, Felix Lindner, and Thorsten Engesser November 23, 2015

More information

An Ontology and Concept Lattice Based Inexact Matching Method for Service Discovery

An Ontology and Concept Lattice Based Inexact Matching Method for Service Discovery An Ontology and Concept Lattice Based Inexact Matching Method for Service Discovery Tang Shancheng Communication and Information Institute, Xi an University of Science and Technology, Xi an 710054, China

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

Knowledge Representation for the Semantic Web Lecture 2: Description Logics I

Knowledge Representation for the Semantic Web Lecture 2: Description Logics I Knowledge Representation for the Semantic Web Lecture 2: Description Logics I Daria Stepanova slides based on Reasoning Web 2011 tutorial Foundations of Description Logics and OWL by S. Rudolph Max Planck

More information

OWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, Pascal Hitzler. AIFB, Universität Karlsruhe (TH) Markus Krötzsch

OWL 2 Rules (Part 1)  Tutorial at ESWC2009 May 31, Pascal Hitzler. AIFB, Universität Karlsruhe (TH) Markus Krötzsch OWL 2 Rules (Part 1) Tutorial at ESWC2009 May 31, 2009 Pascal Hitzler AIFB, Universität Karlsruhe (TH) Markus Krötzsch Sebastian Rudolph http://www.pascal-hitzler.de http://korrekt.org http://www.sebastian-rudolph.de

More information

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1 CS560 Knowledge Discovery and Management Yugi Lee STB #560D (816) 235-5932 leeyu@umkc.edu www.sce.umkc.edu/~leeyu CS560 - Lecture 3 1 Logic A logic allows the axiomatization of the domain information,

More information

RULE-BASED REASONING FOR SYSTEM DYNAMICS IN CELL SYSTEMS

RULE-BASED REASONING FOR SYSTEM DYNAMICS IN CELL SYSTEMS 25 RULE-BASED REASONING FOR SYSTEM DYNAMICS IN CELL SYSTEMS EUNA JEONG MASAO NAGASAKI SATORU MIYANO eajeong@ims.u-tokyo.ac.jp masao@ims.u-tokyo.ac.jp miyano@ims.u-tokyo.ac.jp Human Genome Center, Institute

More information

Logics for Data and Knowledge Representation

Logics for Data and Knowledge Representation Logics for Data and Knowledge Representation 4. Introduction to Description Logics - ALC Luciano Serafini FBK-irst, Trento, Italy October 9, 2012 Origins of Description Logics Description Logics stem from

More information

VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES

VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ARBEITSBEREICH WISSENSBASIERTE SYSTEME VARIABLE-STRENGTH CONDITIONAL PREFERENCES FOR RANKING OBJECTS IN ONTOLOGIES THOMAS LUKASIEWICZ

More information

An Introduction to Description Logic III

An Introduction to Description Logic III An Introduction to Description Logic III Knowledge Bases and Reasoning Tasks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014

More information

A Boolean Lattice Based Fuzzy Description Logic in Web Computing

A Boolean Lattice Based Fuzzy Description Logic in Web Computing A Boolean Lattice Based Fuzzy Description Logic in Web omputing hangli Zhang, Jian Wu, Zhengguo Hu Department of omputer Science and Engineering, Northwestern Polytechnical University, Xi an 7007, hina

More information

Phase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms

Phase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms History Phase 1 implementation of systems based on incomplete structural subsumption algorithms Phase 2 tableau-based algorithms and complexity results first tableau-based systems (Kris, Crack) first formal

More information

CS 1571 Introduction to AI Lecture 14. First-order logic. CS 1571 Intro to AI. Midterm

CS 1571 Introduction to AI Lecture 14. First-order logic. CS 1571 Intro to AI. Midterm CS 1571 Introduction to AI Lecture 14 First-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Midterm The midterm for the course will be held on October 28, 2014 In class exam Closed book

More information

Introduzione alle logiche descrittive

Introduzione alle logiche descrittive Introduzione alle logiche descrittive I principali formalismi di KR Reti semantiche Sistemi a Frame Sistemi di Produzione FOL (First Order Logic) e vari altri linguaggi logici Logiche descrittive Le logiche

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

An Introduction to Description Logics

An Introduction to Description Logics An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013

More information

Mathematical Logics Description Logic: Introduction

Mathematical Logics Description Logic: Introduction Mathematical Logics Description Logic: Introduction Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia

More information

Description Logics. an introduction into its basic ideas

Description Logics. an introduction into its basic ideas Description Logics an introduction into its basic ideas A. Heußner WS 2003/2004 Preview: Basic Idea: from Network Based Structures to DL AL : Syntax / Semantics Enhancements of AL Terminologies (TBox)

More information

Mathematical Logics Description Logic: Tbox and Abox

Mathematical Logics Description Logic: Tbox and Abox Mathematical Logics Description Logic: Tbox and Abox Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and

More information

Deliberative Agents Knowledge Representation I. Deliberative Agents

Deliberative Agents Knowledge Representation I. Deliberative Agents Deliberative Agents Knowledge Representation I Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/

More information

Chapter 2 Background. 2.1 A Basic Description Logic

Chapter 2 Background. 2.1 A Basic Description Logic Chapter 2 Background Abstract Description Logics is a family of knowledge representation formalisms used to represent knowledge of a domain, usually called world. For that, it first defines the relevant

More information

Complexity of Reasoning in Entity Relationship Models

Complexity of Reasoning in Entity Relationship Models Complexity of Reasoning in Entity Relationship Models A. Artale 1, D. Calvanese 1, R. Kontchakov 2, V. Ryzhikov 1, M. Zakharyaschev 2 1 Faculty of Computer Science Free University of Bozen-Bolzano I-39100

More information

A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System

A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System 1 / 31 A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System Judy Zhao 1, Harold Boley 2, Weichang Du 1 1. Faculty of Computer Science, University

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

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1

Semantics and Generative Grammar. Formal Foundations: A Basic Review of Sets and Functions 1 Formal Foundations: A Basic Review of Sets and Functions 1 1. Naïve Set Theory 1.1 Basic Properties of Sets A set is a group of objects. Any group of objects a, b, c forms a set. (1) Representation of

More information

ECE 479/579 Principles of Artificial Intelligence Part I Spring Dr. Michael Marefat

ECE 479/579 Principles of Artificial Intelligence Part I Spring Dr. Michael Marefat ECE 479/579 Principles of Artificial Intelligence Part I Spring 2005 Dr. Michael Marefat (marefat@ece.arizona.edu) Required text "Artificial Intelligence: A Modern Approach, Second Edition" by Stuart Russell

More information

Structured Descriptions & Tradeoff Between Expressiveness and Tractability

Structured Descriptions & Tradeoff Between Expressiveness and Tractability 5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation

More information

OPPA European Social Fund Prague & EU: We invest in your future.

OPPA European Social Fund Prague & EU: We invest in your future. OPPA European Social Fund Prague & EU: We invest in your future. Description Logics Petr Křemen petr.kremen@fel.cvut.cz FEL ČVUT 39 / 157 Our plan Towards Description Logics ALC Language 40 / 157 Towards

More information

Description Logics. Glossary. Definition

Description Logics. Glossary. Definition Title: Description Logics Authors: Adila Krisnadhi, Pascal Hitzler Affil./Addr.: Wright State University, Kno.e.sis Center 377 Joshi Research Center, 3640 Colonel Glenn Highway, Dayton OH 45435, USA Phone:

More information

Ontology and Database Systems: Knowledge Representation and Ontologies Part 2: Description Logics

Ontology and Database Systems: Knowledge Representation and Ontologies Part 2: Description Logics Ontology and Database Systems: Knowledge Representation and Ontologies Diego Calvanese Faculty of Computer Science European Master in Computational Logic A.Y. 2014/2015 Part 2 Description Logics D. Calvanese

More information

Variable-strength conditional preferences for ranking objects in ontologies

Variable-strength conditional preferences for ranking objects in ontologies Web Semantics: Science, Services and Agents on the World Wide Web 5 (2007) 180 194 Variable-strength conditional preferences for ranking objects in ontologies Thomas Lukasiewicz a,,jörg Schellhase b a

More information

Logic for Computer Science - Week 2 The Syntax of Propositional Logic

Logic for Computer Science - Week 2 The Syntax of Propositional Logic Logic for Computer Science - Week 2 The Syntax of Propositional Logic Ștefan Ciobâcă November 30, 2017 1 An Introduction to Logical Formulae In the previous lecture, we have seen what makes an argument

More information

Ontology Evolution Analysis with OWL-MeT

Ontology Evolution Analysis with OWL-MeT Ontology Evolution Analysis with OWL-MeT Natalya Keberle 1, Yuriy Litvineno, Yuriy Gordeyev, Vadim Ermolayev Dept. of IT, Zaporozhye National University, Uraine neberle@gmail.com, jurlit@rambler.ru, ygchaos@mail.ru,

More information

OntoRevision: A Plug-in System for Ontology Revision in

OntoRevision: A Plug-in System for Ontology Revision in OntoRevision: A Plug-in System for Ontology Revision in Protégé Nathan Cobby 1, Kewen Wang 1, Zhe Wang 2, and Marco Sotomayor 1 1 Griffith University, Australia 2 Oxford University, UK Abstract. Ontologies

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

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party = Introduction to Propositional Logic Propositional Logic (PL) is a logical system that is built around the two values TRUE and FALSE, called the TRUTH VALUES. true = 1; false = 0 1. Syntax of Propositional

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

Knowledge Representation and Reasoning

Knowledge Representation and Reasoning Knowledge Representation and Reasoning Geraint A. Wiggins Professor of Computational Creativity Department of Computer Science Vrije Universiteit Brussel Objectives Knowledge Representation in Logic The

More information

A RESOLUTION DECISION PROCEDURE FOR SHOIQ

A RESOLUTION DECISION PROCEDURE FOR SHOIQ A RESOLUTION DECISION PROCEDURE FOR SHOIQ Yevgeny Kazakov and Boris Motik The University of Manchester August 20, 2006 SHOIQ IS A DESCRIPTION LOGIC! Yevgeny Kazakov and Boris Motik A Resolution Decision

More information

A System for Ontologically-Grounded Probabilistic Matching

A System for Ontologically-Grounded Probabilistic Matching A System for Ontologically-Grounded Probabilistic Matching Rita Sharma Georeference Online Ltd. and Dept. of Computer Science, UBC http://www.cs.ubc.ca/ rsharma/ David Poole Department of Computer Science

More information

Probabilistic Ontologies: Logical Approach

Probabilistic Ontologies: Logical Approach Probabilistic Ontologies: Logical Approach Pavel Klinov Applied Artificial Intelligence Lab ECE Department University of Cincinnati Agenda Why do we study ontologies? Uncertainty Probabilistic ontologies

More information

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

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University

More information

Reasoning. Inference. Knowledge Representation 4/6/2018. User

Reasoning. Inference. Knowledge Representation 4/6/2018. User Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world

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

Expressive number restrictions in Description Logics

Expressive number restrictions in Description Logics Expressive number restrictions in Description Logics Franz Baader and Ulrike Sattler August 12, 1999 Abstract Number restrictions are concept constructors that are available in almost all implemented Description

More information

Predicate Logic. x. x + 0 = x. Predicate logic over integer expressions: a language of logical assertions, for example. Why discuss predicate logic?

Predicate Logic. x. x + 0 = x. Predicate logic over integer expressions: a language of logical assertions, for example. Why discuss predicate logic? Predicate Logic Predicate logic over integer expressions: a language of logical assertions, for example x. x + 0 = x Why discuss predicate logic? It is an example of a simple language It has simple denotational

More information

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency A Framework for Representing Ontology Mappings under Probabilities and Inconsistency Andrea Calì 1 Thomas Lukasiewicz 2, 3 Livia Predoiu 4 Heiner Stuckenschmidt 4 1 Computing Laboratory, University of

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

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.

3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas. 1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is

More information

A critical evaluation of ontology languages for geographic information retrieval on the Internet

A critical evaluation of ontology languages for geographic information retrieval on the Internet Journal of Visual Languages and Computing 16 (2005) 331 358 Journal of Visual Languages & Computing www.elsevier.com/locate/jvlc A critical evaluation of ontology languages for geographic information retrieval

More information

Knowledge Representation for the Semantic Web

Knowledge Representation for the Semantic Web Knowledge Representation for the Semantic Web Winter Quarter 2012 Pascal Hitzler Slides 10 02/21/2012 Kno.e.sis Center Wright State University, Dayton, OH http://www.knoesis.org/pascal/ KR4SW Winter 2012

More information

Reading 11 : Relations and Functions

Reading 11 : Relations and Functions CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Reading 11 : Relations and Functions Instructor: Beck Hasti and Gautam Prakriya In reading 3, we described a correspondence between predicates

More information

An Algebra of Qualitative Taxonomical Relations for Ontology Alignments

An Algebra of Qualitative Taxonomical Relations for Ontology Alignments An Algebra of Qualitative Taxonomical Relations for Ontology Alignments Armen Inants and Jérôme Euzenat Inria & Univ. Grenoble Alpes, Grenoble, France {Armen.Inants,Jerome.Euzenat}@inria.fr Abstract. Algebras

More information

CVO103: Programming Languages. Lecture 2 Inductive Definitions (2)

CVO103: Programming Languages. Lecture 2 Inductive Definitions (2) CVO103: Programming Languages Lecture 2 Inductive Definitions (2) Hakjoo Oh 2018 Spring Hakjoo Oh CVO103 2018 Spring, Lecture 2 March 13, 2018 1 / 20 Contents More examples of inductive definitions natural

More information

On Integrating Ontologies with Relational Probabilistic Models

On Integrating Ontologies with Relational Probabilistic Models On Integrating Ontologies with Relational Probabilistic Models Chia-Li Kuo and David Poole Department of Computer Science University of British Columbia Vancouver, BC, Canada V6T 1Z4 {kuo000, poole}@cs.ubc.ca

More information

Geospatial Semantics. Yingjie Hu. Geospatial Semantics

Geospatial Semantics. Yingjie Hu. Geospatial Semantics Outline What is geospatial? Why do we need it? Existing researches. Conclusions. What is geospatial? Semantics The meaning of expressions Syntax How you express the meaning E.g. I love GIS What is geospatial?

More information

Reconciling concepts and relations in heterogeneous ontologies

Reconciling concepts and relations in heterogeneous ontologies 1 Reconciling concepts and relations in heterogeneous ontologies Chiara Ghidini and Luciano Serafini ITC-IRST Via Sommarive 18 I-38040 Trento, Italy {ghidini,serafini}@itc.it Abstract In the extensive

More information

Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE

Axiomatic Semantics. Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE Axiomatic Semantics Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 CSE 6341 1 Outline Introduction What are axiomatic semantics? First-order logic & assertions about states Results (triples)

More information

Logic: Propositional Logic Truth Tables

Logic: Propositional Logic Truth Tables Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06

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

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

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday

More information

Inconsistency-Tolerant Reasoning with OWL DL

Inconsistency-Tolerant Reasoning with OWL DL Inconsistency-Tolerant Reasoning with OWL DL Xiaowang Zhang a,, Guohui Xiao b, Zuoquan Lin c, Jan Van den Bussche a a Hasselt University and transnational University of Limburg, 3590 Diepenbeek, Belgium

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields 1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative

More information

A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI

A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI A Refined Tableau Calculus with Controlled Blocking for the Description Logic Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky School of Computer Science, The University of Manchester, UK Abstract

More information

Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web Andrea Calì 1, Thomas Lukasiewicz 1, 2, Livia Predoiu 3, and Heiner Stuckenschmidt 3 1 Computing Laboratory, University of

More information

SPEAKING MATHEMATICALLY. Prepared by Engr. John Paul Timola

SPEAKING MATHEMATICALLY. Prepared by Engr. John Paul Timola SPEAKING MATHEMATICALLY Prepared by Engr. John Paul Timola VARIABLE used as a placeholder when you want to talk about something but either (1) has one or more values but you don t know what they are, or

More information

Consequence-Based Reasoning for Ontology Classification

Consequence-Based Reasoning for Ontology Classification Consequence-Based Reasoning for Ontology Classification František Simančík Worcester College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2013 Abstract Description

More information

Tractable Extensions of the Description Logic EL with Numerical Datatypes

Tractable Extensions of the Description Logic EL with Numerical Datatypes Tractable Extensions of the Description Logic EL with Numerical Datatypes Despoina Magka, Yevgeny Kazakov, and Ian Horrocks Oxford University Computing Laboratory Wolfson Building, Parks Road, OXFORD,

More information

1. Introduction to commutative rings and fields

1. Introduction to commutative rings and fields 1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative

More information

Description Logics (DLs)

Description Logics (DLs) OWL Three species of OWL OWL full is union of OWL syntax and RDF (Undecidable) OWL DL restricted to FOL fragment (decidable in NEXPTIME) OWL Lite is easier to implement subset of OWL DL (decidable in EXPTIME)

More information

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated

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

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

Reconciling concepts and relations in heterogeneous ontologies

Reconciling concepts and relations in heterogeneous ontologies Reconciling concepts and relations in heterogeneous ontologies Chiara Ghidini and Luciano Serafini ITC-IRST Via Sommarive 18 I-38040 Trento, Italy {ghidini,serafini}@itc.it Abstract. In the extensive usage

More information

Lecture 10: Predicate Logic and Its Language

Lecture 10: Predicate Logic and Its Language Discrete Mathematics (II) Spring 2017 Lecture 10: Predicate Logic and Its Language Lecturer: Yi Li 1 Predicates and Quantifiers In this action, we show you why a richer language should be introduced than

More information