Logic …. Disjoint Properties As for disjoint classes, two properties can be disjoint (owl : propertyDisjointWith) Property p and p’ are disjoint if no.

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Of 27 lecture 7: owl - introduction. of 27 ece 627, winter ‘132 OWL a glimpse OWL – Web Ontology Language describes classes, properties and relations.
Chapter 8: Web Ontology Language (OWL) Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Chapter 8: Web Ontology Language (OWL) Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Sets. A set is a well-defined collection of values of the same kind (objects) Objects can be numbers, people, letters, days, may be sets themselves Examples.
Functions. A function between two sets is a relation between those sets that has a special property, namely that each member of the from-set is related.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Sets.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
13 Dec. 2006CmpE 583 Fall 2006 OWL Lite- Property Char’s. 1 OWL Lite: Ch. 13- Property Characteristics Atilla ELÇİ.
1 MASWS Multi-Agent Semantic Web Systems: OWL Stephen Potter, CISA, School of Informatics, University of Edinburgh, Edinburgh, UK.
OWL 2 in use. OWL 2 OWL 2 is a knowledge representation language, designed to formulate, exchange and reason with knowledge about a domain of interest.
Basic Concepts of Discrete Probability (Theory of Sets: Continuation) 1.
Chapter 3 – Set Theory  .
The Knowledge Presentation Language. Web Ontology Language (OWL)  Web Ontology Language (OWL) extends RDF and RDFS languages by adding several other.
Michael Eckert1CS590SW: Web Ontology Language (OWL) Web Ontology Language (OWL) CS590SW: Semantic Web (Winter Quarter 2003) Presentation: Michael Eckert.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Logic 2. Complex classes and roles OWL DL (language to build ontologies) uses Description Logic (DL), which is a family of knowledge representation formalisms.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
P.1 Real Numbers. 2 What You Should Learn Represent and classify real numbers. Order real numbers and use inequalities. Find the absolute values of real.
Part I: Set Constructs. RDF Schema (RDFS) RDF does not provide mechanisms to define domain classes and properties RDFS is a vocabulary that provides many.
Ontology Building in Action Hasan TÜRKSOY Compiled, partly based on various online tutorials and presentations, with respect to their authors.
1.4 Sets Definition 1. A set is a group of objects . The objects in a set are called the elements, or members, of the set. Example 2 The set of positive.
Discrete Structure Sets. 2 Set Theory Set: Collection of objects (“elements”) a  A “a is an element of A” “a is a member of A” a  A “a is not an element.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
CompSci 102 Discrete Math for Computer Science
Theory and Applications
© O. Corcho, MC Suárez de Figueroa Baonza 1 OWL and SWRL Protégé 4: Building an OWL Ontology Mari Carmen Suárez-Figueroa, Oscar Corcho {mcsuarez,
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Mathematical Preliminaries
Chapter 2 With Question/Answer Animations. Section 2.1.
Rosen 1.6, 1.7. Basic Definitions Set - Collection of objects, usually denoted by capital letter Member, element - Object in a set, usually denoted by.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
OWL Web Ontology Language Overview. The OWL Web Ontology Language is designed for use by applications that need to process the content of information.
Copyright © Cengage Learning. All rights reserved. Fundamental Concepts of Algebra 1.1 Real Numbers.
Semantic Web for the Working Ontologist Dean Allemang Jim Hendler SNU IDB laboratory.
CC L A W EB DE D ATOS P RIMAVERA 2015 Lecture 4: Web Ontology Language (I) Aidan Hogan
ece 627 intelligent web: ontology and beyond
Semantic Web for the Working Ontologist Dean Allemang Jim Hendler SNU IDB laboratory.
Ontology Engineering Lab #4 - September 23, 2013.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Formal Semantics Purpose: formalize correct reasoning.
Of 32 lecture 8: owl – language I. of 32 ece 627, winter ‘132 OWL XML/RDF syntax: header
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
Ccs.  Ontologies are used to capture knowledge about some domain of interest. ◦ An ontology describes the concepts in the domain and also the relationships.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
1 Letting the classifier check your intuitions Existentials, Universals, & other logical variants Some, Only, Not, And, Or, etc. Lab exercise - 3b Alan.
“It is impossible to define every concept.” For example a “set” can not be defined. But Here are a list of things we shall simply assume about sets. A.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
ece 720 intelligent web: ontology and beyond
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
ece 720 intelligent web: ontology and beyond
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
Service-Oriented Computing: Semantics, Processes, Agents
{(1, 1), (2, 4), (3, 9), (4, 16)} one-to-one
Description Logics.
Logics for Data and Knowledge Representation
Knowledge Representation Part VII Protégé / RDFS / OWL / ++
Presentation transcript:

Logic …

Disjoint Properties As for disjoint classes, two properties can be disjoint (owl : propertyDisjointWith) Property p and p’ are disjoint if no two triple (SPO) statements exist that use these properties as predicate with the same subject (S, domain) and object (O, range) individuals. Let’s define: Person hasMother Woman Person hasFather Man If hasMother and hasFather properties are declared to be disjoint If RyanT is a Person and AshleyT is a Woman, we cannot assert: RyanT hasMother AshleyT and RyanT hasFather AshleyT S P O S P’ O B object A a1 subject p P’ b1 Woman object Person RyanT subject hasMother AshleyT hasFather

Disjoint Properties … Let’s declare the meltsTo and crystallizesTo, or linearAttitude and planarAttitude, as pairs of disjoint properties And define their domain and range: Notice that the subjects and objects of each of these two pairs of universal statements are the same Also notice that the two disjoint properties are neither inverse nor symmetric We cannot simultaneously make the following pair of assertions: Rock object Magma subject crystallizesTo rhyolite5meltsTomagma2 SPO: Magma crystallizesTo Rock SP’O Magma meltsTo Rock magma2 crystallizesTo rhyolite5 magma2 meltsTo andesite5

Individual (Assertional) Axioms Individual axioms include those that assert that an individual belongs to a set, e.g., C(a) denotes that a is a member (particular; individual, instance) of set (universal) C StrikSlipFault (“San Andreas Fault”) Batholith (“Idaho Batholith”) City (“Los Angeles”) Note: The “San Andreas Fault” and “Idaho Batholith” are members of the StrikeSlipFault and Batholith set, respectively. Given: StrikSlipFault (“San Andreas Fault”) We infer that: (StrikeSlipFault  Fault)  (“San Andreas Fault”  Fault)

Assertions … p (a, b) or a p b asserts that an individual a is related to another individual b with the relation (property) p locatedIn (“San Andreas Fault”, “California”) asserts that individual San Andreas Fault is located in California, and intrudes (“IdahoBatholith”, “BeltSupergroup”)

Equality between Individuals Equality or inequality between two individuals, a and b, is asserted as a  b or a  b, respectively For example, we may want to state that “Boulder Batholith” is equivalent to “Boulder Intrusion” by asserting: “Boulder Batholith”  “Boulder Intrusion” “WindyCity”  “Chicago”

Domain and Range Restrictions Domain and range are used to infer membership of instances to certain classes Domain and range define the subject (source) and object (target) of a property (p), respectively Country hasCapital City Country is the domain and City is range for hasCapital Mineral ageDate IsotopicAge The domain for the ageDate property in the above statement is the Mineral class, and its range is the IsotopicAge class All instances of the Mineral class (e.g., aMica) have an ageDate property that is of the IsotopicAge type; which in this case has a value of age IsotopicAge Mineral ageaMica ageDate Target class or Range Source class or Domain

Local Property Restriction Property restriction puts a local constraint on the use of the property A property restriction is a special kind of class description It describes an anonymous class, namely a class of all individuals that satisfy the restriction The restriction puts a condition for using the property by individuals of a class

Property Restriction … Later we will learn that in OWL, local property restrictions are applied to a class by making the class either an owl:subclassOf or an owl:equivalentClass of the unnamed (i.e., anonymous) restriction class which bears the condition for membership by its restricted property The restriction provides a necessary and sufficient condition for membership

Types of Property Restriction OWL has two kinds of property restrictions: value constraints and cardinality constraints There are four types of value restriction: owl:allValuesFrom,  P.C owl:someValuesFrom,  P.C owl:hasValue owl:selfRestriction

owl : allValuesFrom,  P.C Provides a value restriction for the range of a property T   P.R all values of P come from the object (range) class R The  connective corresponds to owl : allValuesFrom construct, which means: for all instances, if they have the property or relation P, it must have the specified range i.e., the object values for the property come from the class C  P.C denotes the set of individuals a, such that for any individual b, if P relates a to b, then b is in C i.e., the range for P is class C A C ab P Range

 P.C Example The set of individuals that are related by property P only to individuals of class C  locatedIn.Nevada, is the set of individuals located only in Nevada, and not anywhere else NevadaCity  City   locatedIn.Nevada The  connective reads: ‘for all, if any’, meaning that the occurrence can be many or zero To say that igneous rocks are those rocks that form only from crystallization out of a magma, we assert: IgneousRock  Rock   crystallizeFrom.Magma Only cylindrical folds have axis: CylindricalFold  Fold   hasAxis.Axis Non-cylindrical fold is one without any axis: NonCylindricalFold  Fold   CylindricalFold CityNevada ab locatedIn Range IgneousRock Magma crystallizeFrom Range Rock

owl:someValuesFrom,  P.C The  connective corresponds to the owl:someValuesFrom construct, which means: For all instances, they must have at least one occurrence of the property with the specified range Some (at least one) values of the property P come from class C Like the  connective, the  connective provides a value restriction for the range of a property A C ab P Range

…  P.C denotes the set of individuals a, such that there exists an individual b, such that P relates a to b, and b is in C It denotes the set of individuals that are related to some individuals of class C by property P The  connective reads: ‘there exists at least one’  crystallize.Mineral means the set of individuals (not necessarily magma; could be water or cat) that crystallize some mineral, e.g., CoolingLava  (Lava   crystallize.Mineral) i.e., cooling lava is a lava that crystallizes at least one mineral e.g., Lava C e.g., Mineral a b crystallize P Lava C e.g., Mineral b crystallize P CoolingLava a Range

Owl : hasValue & owl : selfRestriction The owl:hasValue is a special kind of the owl:someValuesFrom. It means that all instances must have the property with the exact value For example, it is used when we want to restrict the range of the hasMoon property only to Saturn, i.e., only deal with the moons of Saturn, We can restrict the hasMylonite property to the San Andreas Fault The owl:selfRestriction makes a restriction on a property that relates an individual to itself, e.g., selfRising, selfAbsorption

Cardinality Number Restrictions (  n P) owl : minCardinality Cardinality restrictions specify the number of times a property can be used to describe an instance of a class The unqualified number restriction (  n P) (owl : minCardinality) denotes the class of individuals (class is not unspecified) that are related to at least n individuals by the property P (i.e., there must be at least n count of the property, where n is a non-negative integer) RockMineral ab  1 hasMineral

Qualified Number Restriction The three cardinalities are called unqualified because the class of individuals is unspecified, e.g., (  n P) If qualified, i.e., (  n P).C), for example, the Rock class is related to at least 1 mineral from the Mineral class by the hasMineral property (  n R).C Rock  (  1 hasMineral).Mineral i.e., Rock has one or more minerals Car  (  1 hasWheel).Wheel

(  n P) owl : maxCardinality The unqualified number restriction (  n P) (owl : maxCardinality) denotes the class of individuals that are related to at most n individuals by the property P For example, instances of the s atomic subshell can have at most 2 electrons (  2 hasElectron) (SAtomicShell  Shell)  (  2 hasElectron).Electron SAtomicShell Electron b  2 hasElectron Shell a

(  n P).C and (  n P).C The  n R.C and  n R.C are qualified number restrictions because the class C is specified For example, we can state that cylindrical fold has at most one hinge line by: CylindricalFold  Fold  (  1 hingeline).Axis MeanderingRiver  River  (  1 meander).Meander Silicon-oxygen tetrahedra in tectosilicates share all (i.e., 4) of their oxygens (i.e., share exactly all four) Tectosilicate  Silicate  (  4 tetrahedraShares).Oxygen  (  4 tetrahedraShares).Oxygen  =

owl : cardinality The owl : cardinality can be expressed as the intersection of the owl : maxCardinality and owl : minCardinality For this case, there are exactly n properties For example, monomineralic rock is a rock with exactly one kind of mineral: MonomineralicRock  Rock  (  1 hasMineral).Mineral  (  1 hasMineral).Mineral  1  1 1