Fuzzy DL, Fuzzy SWRL, Fuzzy Carin (report from visit to Athens) M.Vacura VŠE Praha (used materials by G.Stoilos, NTU Athens)

Slides:



Advertisements
Similar presentations
Hybrid Logics and Ontology Languages
Advertisements

Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
CS848: Topics in Databases: Foundations of Query Optimization Topics covered  Introduction to description logic: Single column QL  The ALC family of.
Knowledge Representation and Reasoning using Description Logic Presenter Shamima Mithun.
Bart Gajderowicz, Ryerson University, Dept. of Computer Science
OWL - DL. DL System A knowledge base (KB) comprises two components, the TBox and the ABox The TBox introduces the terminology, i.e., the vocabulary of.
A rule language for the semantic web Dieter Fensel, Lausanne, June 14, 2004 SDK cluster meeting on WSMO.
An Introduction to Description Logics
Of 27 lecture 7: owl - introduction. of 27 ece 627, winter ‘132 OWL a glimpse OWL – Web Ontology Language describes classes, properties and relations.
N. Simou, G. Stoilos, V. Tzouvaras, G. Stamou, S. Kollias 4th International Workshop on Uncertainty Reasoning for the Semantic.
Combining the strengths of UMIST and The Victoria University of Manchester A Tableaux Decision Procedure for SHOIQ Ian Horrocks and Ulrike Sattler University.
Context Representation and Reasoning with Formal Ontologies Juan Gómez-Romero 1,2, University Carlos III of Madrid (Spain) Fernando Bobillo 2, University.
Ontology and Ontology-Based Applications C. Farkas Some of the slides were obtained from presentations of Ian Horrocks.
Description Logics. Outline Knowledge Representation Knowledge Representation Ontology Language Ontology Language Description Logics Description Logics.
COMP 578 Fuzzy Sets in Data Mining Keith C.C. Chan Department of Computing The Hong Kong Polytechnic University.
DL systems DL and the Web Ilie Savga
Part 6: Description Logics. Languages for Ontologies In early days of Artificial Intelligence, ontologies were represented resorting to non-logic-based.
ANHAI DOAN ALON HALEVY ZACHARY IVES Chapter 12: Ontologies and Knowledge Representation PRINCIPLES OF DATA INTEGRATION.
FiRE Fuzzy Reasoning Engine Nikolaos Simou National Technical University of Athens.
Chapter 6 Understanding Each Other CSE 431 – Intelligent Agents.
Description Logics Franz Baader, Ian Horrocks, Ulrike Sattler Presented By Jahan Ara Arju Muhammad Nazmus Sakib CSCE
Fuzzy Logic. Lecture Outline Fuzzy Systems Fuzzy Sets Membership Functions Fuzzy Operators Fuzzy Set Characteristics Fuzziness and Probability.
An Introduction to Description Logics. What Are Description Logics? A family of logic based Knowledge Representation formalisms –Descendants of semantic.
Applying Belief Change to Ontology Evolution PhD Student Computer Science Department University of Crete Giorgos Flouris Research Assistant.
Tableau Algorithm.
CSE-291: Ontologies in Data & Process Integration Department of Computer Science & Engineering University of California, San Diego CSE-291: Ontologies.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
Query Answering Based on the Modal Correspondence Theory Evgeny Zolin University of Manchester Manchester, UK
Building an Ontology of Semantic Web Techniques Utilizing RDF Schema and OWL 2.0 in Protégé 4.0 Presented by: Naveed Javed Nimat Umar Syed.
Description Logics. What Are Description Logics? A family of logic based KR formalisms – Descendants of semantic networks and KL-ONE – Describe domain.
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.
Presented by:- Somya Gupta( ) Akshat Malu ( ) Swapnil Ghuge ( ) Franz Baader, Ian Horrocks, and Ulrike Sattler.
An Introduction to Description Logics (chapter 2 of DLHB)
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
DEDUCTION PRINCIPLES AND STRATEGIES FOR SEMANTIC WEB Resolution principle, Description Logic and Fuzzy Description Logic Hashim Habiballa University of.
Description Logics.
LDK R Logics for Data and Knowledge Representation Description Logics (ALC)
More on Description Logic(s) Frederick Maier. Note Added 10/27/03 So, there are a few errors that will be obvious to some: So, there are a few errors.
LDK R Logics for Data and Knowledge Representation Description Logics.
Organization of the Lab Three meetings:  today: general introduction, first steps in Protégé OWL  November 19: second part of tutorial  December 3:
1 Comparison and Combination of the Expressive Power of Description Logics and Logic Programs Jidi (Judy) Zhao December 7, 2015.
DL Overview Second Pass Ming Fang 06/19/2009. Outlines  Description Languages  Knowledge Representation in DL  Logical Inference in DL.
4-Nov-05 CS6795 Semantic Web Techniques 1 Description Logic – 2.
References [1] D:\My Documents\SemanticWebWorkshop\kaynak\Ian Horrocks - CS646\intro-2004.pptD:\My Documents\SemanticWebWorkshop\kaynak\Ian Horrocks -
Description Logics Dr. Alexandra I. Cristea. Description Logics Description Logics allow formal concept definitions that can be reasoned about to be expressed.
ece 627 intelligent web: ontology and beyond
5. Semantics of Web Services XML, Google: The syntactic web Web Services and WSDL Classical procedure invocation based on: Procedure names Parameter types.
Complexity of Reasoning
Of 35 lecture 17: semantic web rules. of 35 ece 627, winter ‘132 logic importance - high-level language for expressing knowledge - high expressive power.
Knowledge Repn. & Reasoning Lec #11+13: Frame Systems and Description Logics UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
Hitzler ● OWL1.1 Rules ● DedSys Saarbrücken ● March 2008 AIFB ReaSem Slide 1 OWL 1.1 Rules Markus Krötzsch Sebastian Rudolph Pascal Hitzler AIFB, University.
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2011 Adina Magda Florea
Of 29 lecture 15: description logic - introduction.
LDK R Logics for Data and Knowledge Representation Description Logics: family of languages.
LDK R Logics for Data and Knowledge Representation Description Logics.
Knowledge Representation Part II Description Logic & Introduction to Protégé Jan Pettersen Nytun.
Description Logics.
ece 720 intelligent web: ontology and beyond
Using Rules with Ontologies in the Semantic Web
ece 720 intelligent web: ontology and beyond
Ontology.
ece 720 intelligent web: ontology and beyond
Logics for Data and Knowledge Representation
Ontology.
Description Logics.
Logics for Data and Knowledge Representation
Description logics (book, page 456)
A Tutorial Summary of Description Logic and Hybrid Rules
CIS Monthly Seminar – Software Engineering and Knowledge Management IS Enterprise Modeling Ontologies Presenter : Dr. S. Vasanthapriyan Senior Lecturer.
Presentation transcript:

Fuzzy DL, Fuzzy SWRL, Fuzzy Carin (report from visit to Athens) M.Vacura VŠE Praha (used materials by G.Stoilos, NTU Athens)

Description Logics Concept and Role Oriented Concepts (Unary): Man, Tall, Human, Brain Roles (Binary): hasChild, hasColor Individuals: John, Object 1, Italy, Monday

Concepts Concepts: Universal ⊤ Empty ⊥ Atomic/primitive concepts (concept names) Complex concepts (terms) Concept Constructors: , ⊔, ⊓, , , ,  ( Animal ⊓ Rational)

Axioms Concept Axioms – T box (terminology) Woman  Person ⊓ Female Parent  Person ⊓  hasChild.Person Role Axioms – R box hasSon  hasChild Trans(hasOffspring) Instance Axioms (Assertions) – A box Bob: Parent (Bob,Helen):hasChild

Typology of DLs Constructors of Description logics AL Negation:  A(A primitive) Conjunction: (A ⊓ B) Universal quantification:  R.C Limited existential quantification:  R. ⊤

Typology of DLs Constructors of Description logics ALU (A ⊔ B)(disjunction) Constructors of Description logics ALE  R.C(full existencial quantification) Constructors of Description logics ALN (  n C), (  n C)(numerical restriction) Constructors of Description logics ALC (  A) (full negation)

Typology of DLs Description logics S ALC R+ = ALC + transitive roles axioms. Trans(hasOffspring) Description logics SH SH = S + role hiearchy axioms. hasSon  hasChild Description logics SHf SHf = SH + role functional axioms. Func(R)

Typology of DLs Description logics SHO SHO = SH + nominal axioms. C  {a} Description logics SHOI SHO = SH + inverse role axioms. Description logics SHOIN SHOIN = SHOI + numerical restrictions.

Typology of DLs Description logics SHOIQ SHOIQ = SHOI + qualified numerical restrictions. Description logics SROIQ SROIQ = SHOIQ + extended role axioms disjoint roles, reflexive and irreflexive roles, negated role assertions (A box), complex role inclusion axioms, local reflexivity axioms.

Important DLs ALC – base DL SHOIN – OWL DL SROIQ – OWL DL 1.1 (Support for datatypes)

Uncertainty and Applications Several Applications from Industry and Academic face uncertain imprecision: Multimedia Processing (Image Analysis and Annotation) Medical Diagnosis Geospatial Applications Information Retrieval Sensor Readings Decision Making

Uncertainty Imprecision (Possibility Theory) Vagueness (Fuzzy Set Theory) Randomness (Probability Theory)

Fuzzy Set Theory An object belongs to a set to a degree between 0 and 1. (membership degree). Tall(George)=0.7 A pair of objects belongs to a relation to a degree between 0 and 1. (membership degree). Far(Prague,Paris)=0.6

Fuzzy Set Theoretic Operations Complement: c(x) c(x)=1-x Intersection: t(x,y) t(x,y)=min(x,y), t(x,y)=max(0,x+y-1) t-norm Godel, Lukasiewicz Union: u(x,y) u(x,y)=max(x,y), u(x,y)=min(1,x+y) s-norm Godel, Lukasiewicz Implication: J(x,y) J(x,y)=max(1-x,y), J(x,y)=min(1,1-x+y) Kleene-Dienes, Lukasiewicz

Fuzzy DLs Syntax Extensions A box Fuzzy assertions: DLAssertion { , , >, <} [0,1] George:Tall  0.7, (Prague, Paris):Far  0.6

Complex concepts Bob:Tall  0.8 Bob:Athletic  0.6 Bob:(Athletic ⊓ Tall)  t(0.6,0.8)

Reasoning Usually DL Reasoning is done with tableaux algorithms. Tableaux algorithms can be extended to deal with fuzziness NTU Athens - Implementation for f KD -SHIN Reasoner FIRE

Future Fuzzy T box  0,6 Fuzzy R box  0,3

Fuzzy SWRL

SWRL A Semantic Web Rule Language Combining OWL and RuleML (undecidable) RuleML – Rule Markup Language (

Fuzzy SWRL OWL – A box: OWL asserions can include a specification of the “degree” (a truth value between 0 and 1) of confidence with which we assert that an individual (resp. pair of individuals) is an instance of a given class (resp.property). RuleML atoms can include a “weight” (a truth value between 0 and 1) that represents the “importance” of the atom in a rule.

Fuzzy SWRL Fuzzy rule assertions: antecedent → consequent parent(?x, ?p) ∧ Happy(?p) → Happy(?x) *0.8, EyebrowsRaised(?a)*0.9 ∧ MouthOpen(?a)*0.8 → Happy(?a)

Fuzzy Carin

Carin combines the description logic ALCNR with Horn Rules. Fuzzy Carin adds fuzziness to Carin. (decidable)

Fuzzy Carin

END