Скачать презентацию Reasoning with Expressive Description Logics Logical Foundations for Скачать презентацию Reasoning with Expressive Description Logics Logical Foundations for

feff33209b214fd2c3210360c1f65b56.ppt

  • Количество слайдов: 43

Reasoning with Expressive Description Logics Logical Foundations for the Semantic Web Ian Horrocks <horrocks@cs. Reasoning with Expressive Description Logics Logical Foundations for the Semantic Web Ian Horrocks University of Manchester, UK

Talk Outline • Introduction to Description Logics • The Semantic Web: Killer App for Talk Outline • Introduction to Description Logics • The Semantic Web: Killer App for (DL) Reasoning? – Semantic Web Background – Ontology Languages for the Semantic Web • Reasoning with OWL – Oile. Ed Demo (if time) • Description Logic Reasoning • Research Challenges

Summary 1 • DLs are family of object oriented KR formalisms related to frames Summary 1 • DLs are family of object oriented KR formalisms related to frames and Semantic networks – Distinguished by formal semantics and inference services • Semantic Web aims to make web resources accessible to automated processes – Ontologies will play key role by providing vocabulary for semantic markup • OWL is a DL based ontology language designed for the Web – – Exploits existing standards: XML, RDF(S) Adds KR idioms from object oriented and frame systems W 3 C recommendation and already widely adopted in e-Science DL provides formal foundations and reasoning support

Summary 2 • Reasoning is important because – Understanding is closely related to reasoning Summary 2 • Reasoning is important because – Understanding is closely related to reasoning – Essential for design, maintenance and deployment of ontologies • Reasoning support based on DL systems – Sound and complete reasoning – Highly optimised implementations • Challenges remain – – Reasoning with full OWL language (Convincing) demonstration(s) of scalability New reasoning tasks Development of (more) high quality tools and infrastructure

Introduction to Description Logics Introduction to Description Logics

What Are Description Logics? • A family of logic based Knowledge Representation formalisms – What Are Description Logics? • A family of logic based Knowledge Representation formalisms – Descendants of semantic networks and KL-ONE – Describe domain in terms of concepts (classes), roles (relationships) and individuals • Distinguished by: – Formal semantics (typically model theoretic) • Decidable fragments of FOL • Closely related to Propositional Modal & Dynamic Logics – Provision of inference services • Sound and complete decision procedures for key problems • Implemented systems (highly optimised)

DL Architecture Man ´ Human u Male Happy-Father Man u 9 has-child ´ Female DL Architecture Man ´ Human u Male Happy-Father Man u 9 has-child ´ Female u … Abox (data) John : Happy-Father h. John, Mary : has-child i John: 6 1 has-child Interface Tbox (schema) Inference System Knowledge Base

Short History of Description Logics Phase 1: – Incomplete systems (Back, Classic, Loom, . Short History of Description Logics Phase 1: – Incomplete systems (Back, Classic, Loom, . . . ) – Based on structural algorithms Phase 2: – Development of tableau algorithms and complexity results – Tableau-based systems for Pspace logics (e. g. , Kris, Crack) – Investigation of optimisation techniques Phase 3: – Tableau algorithms for very expressive DLs – Highly optimised tableau systems for Exp. Time logics (e. g. , Fa. CT, DLP, Racer) – Relationship to modal logic and decidable fragments of FOL

Latest Developments Phase 4: – Mature implementations – Mainstream applications and Tools • Databases Latest Developments Phase 4: – Mature implementations – Mainstream applications and Tools • Databases – Consistency of conceptual schemata (EER, UML etc. ) – Schema integration – Query subsumption (w. r. t. a conceptual schema) • Ontologies and Semantic Web, Grid and e-Science – Ontology engineering (design, maintenance, integration) – Reasoning with ontology-based markup (meta-data) – Service description and discovery – Commercial implementations • Cerebra system from Network Inference Ltd

Semantic Web: Killer App for DL Reasoning? Semantic Web: Killer App for DL Reasoning?

History of the Semantic Web • • Web was “invented” by Tim Berners-Lee (amongst History of the Semantic Web • • Web was “invented” by Tim Berners-Lee (amongst others), a physicist working at CERN His vision of the Web was much more ambitious than the reality of the existing (syntactic) Web: “… a plan for achieving a set of connected applications for data on the Web in such a way as to form a consistent logical web of data …” “… an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation …” • This vision of the Web has become known as the Semantic Web

! pe Scientific American, May 2001: w e B • • • e ar ! pe Scientific American, May 2001: w e B • • • e ar f o e th y H Realising the complete “vision” is too hard for now (probably) Can make a start by adding semantic annotation to web resources Already seeing exciting applications of technology in e-Science

Hard Work using the Syntactic Web… Find images of Peter Patel-Schneider, Frank van Harmelen Hard Work using the Syntactic Web… Find images of Peter Patel-Schneider, Frank van Harmelen and Alan Rector… Rev. Alan M. Gates, Associate Rector of the Church of the Holy Spirit, Lake Forest, Illinois

Solution(? ): Add “Semantic Markup” • Annotations added to web pages (and other web Solution(? ): Add “Semantic Markup” • Annotations added to web pages (and other web accessible resources) • “Semantics” given by ontologies – Ontologies provide a vocabulary of terms used in annotations – New terms can be formed by combining existing ones – Meaning (semantics) of such terms is formally specified – Need to agree on a standard web ontology language

Ontology Languages for the Semantic Web Ontology Languages for the Semantic Web

RDF and RDFS • RDF stands for Resource Description Framework • It is a RDF and RDFS • RDF stands for Resource Description Framework • It is a W 3 C candidate recommendation (http: //www. w 3. org/RDF) • RDF is graphical formalism ( + XML syntax + semantics) – for representing metadata – for describing the semantics of information in a machineaccessible way • RDFS extends RDF with “schema vocabulary”, e. g. : – Class, Property – type, sub. Class. Of, sub. Property. Of – range, domain

RDF Syntax: Triples Subject ex: subject _: xxx Property ex: property Object ex: object RDF Syntax: Triples Subject ex: subject _: xxx Property ex: property Object ex: object _: yyy « plain litteral » « lexical » ^^datatype Jean-François Baget

RDF Syntax: Graphs « Ian Horrocks » « University of Manchester » ex: name RDF Syntax: Graphs « Ian Horrocks » « University of Manchester » ex: name _: xxx ex: name ex: member-of rdf: type ex: Person _: yyy rdf: type ex: Organisation Jean-François Baget

RDFS • RDFS vocabulary adds constraints on models, e. g. : – 8 x, RDFS • RDFS vocabulary adds constraints on models, e. g. : – 8 x, y, z type(x, y) and sub. Class. Of(y, z) ) type(x, z) ex: Person ex: Animal rdfs: sub. Class. Of ex: John rdf: type ex: Person ex: Animal

RDFS • RDFS allows arbitrary use of schema vocabulary – Can be used/abused to RDFS • RDFS allows arbitrary use of schema vocabulary – Can be used/abused to say very strange things! ex: Person rdf: type rdfs: sub. Property. Of rdfs: sub. Class. Of

RDF/RDFS Semantics • RDF has “Non-standard” semantics given by RDF Model Theory (MT) – RDF/RDFS Semantics • RDF has “Non-standard” semantics given by RDF Model Theory (MT) – IR, a non-empty set of resources – IS, a mapping from V into IR – IP, a distinguished subset of IR (the properties) – IEXT, a mapping from IP into the powerset of IR£IR • Class interpretation ICEXT induced by IEXT(IS(type)) – ICEXT(C) = {x | (x, C) 2 IEXT(IS(type))} • RDFS adds constraints on models – {(x, y), (y, z)} µ IEXT(IS(sub. Class. Of)) ) (x, z) 2 IEXT(IS(sub. Class. Of))

Problems with RDFS • RDFS too weak to describe resources in sufficient detail – Problems with RDFS • RDFS too weak to describe resources in sufficient detail – No localised range and domain constraints • Can’t say that the range of has. Child is person when applied to persons and elephant when applied to elephants – No existence/cardinality constraints • Can’t say that all instances of person have a mother that is also a person, or that persons have exactly 2 parents – No transitive, inverse or symmetrical properties • Can’t say that is. Part. Of is a transitive property, that has. Part is the inverse of is. Part. Of or that touches is symmetrical – … • Difficult to provide reasoning support – No “native” reasoners for non-standard semantics – May be possible to reason via FO axiomatisation

From RDF to OWL • Two languages developed by extending (part of) RDF – From RDF to OWL • Two languages developed by extending (part of) RDF – OIL: developed by group of (largely) European researchers (several from EU Onto. Knowledge project) – DAML-ONT: developed by group of (largely) US researchers (in DARPA DAML programme) • Efforts merged to produce DAML+OIL – Development was carried out by “Joint EU/US Committee on Agent Markup Languages” – Extends (“DL subset” of) RDF • DAML+OIL submitted to W 3 C as basis for standardisation – Web-Ontology (Web. Ont) Working Group formed – Web. Ont group developed OWL language based on DAML+OIL – OWL language now a W 3 C Proposed Recommendation

OWL Language • Three species of OWL – OWL full is union of OWL OWL Language • Three species of OWL – OWL full is union of OWL syntax and RDF – OWL DL restricted to FOL fragment (¼ DAML+OIL) – OWL Lite is “simpler” subset of OWL DL • Semantic layering – OWL DL ¼ OWL full within DL fragment • OWL DL based on SHIQ Description Logic – In fact it is equivalent to SHOIN(Dn) DL • OWL DL Benefits from many years of DL research – – Well defined semantics Formal properties well understood (complexity, decidability) Known reasoning algorithms Implemented systems (highly optimised)

OWL Class Constructors • XMLS datatypes as well as classes in 8 9 8 OWL Class Constructors • XMLS datatypes as well as classes in 8 9 8 P. C and 9 P. C – E. g. , 9 has. Age. non. Negative. Integer (see work by Zhiming Pan) • Arbitrarily complex nesting of constructors – E. g. , Person u 8 has. Child. Doctor t 9 has. Child. Doctor

RDFS Syntax E. g. , Person u 8 has. Child. (Doctor t 9 has. RDFS Syntax E. g. , Person u 8 has. Child. (Doctor t 9 has. Child. Doctor):

OWL Axioms • Axioms (mostly) reducible to inclusion (v) – C ´ D iff OWL Axioms • Axioms (mostly) reducible to inclusion (v) – C ´ D iff both C v D and D v C • Obvious FOL equivalences – E. g. , C ´ D , x. C(x) $ D(x), C v D , x. C(x) !D(x)

Reasoning with OWL Reasoning with OWL

OWL and Description Logic • OWL DL corresponds to SHOIN(Dn) Description Logic – Provides OWL and Description Logic • OWL DL corresponds to SHOIN(Dn) Description Logic – Provides well defined semantics – Formal properties well understood (complexity, decidability) – Facilitates provision of reasoning services (using DL systems) Why do we want/need reasoning services for the Semantic Web?

Philosophical Reasons • Semantic Web aims at “machine understanding” • Understanding closely related to Philosophical Reasons • Semantic Web aims at “machine understanding” • Understanding closely related to reasoning – Recognising semantic similarity in spite of syntactic differences – Drawing conclusions that are not explicitly stated

Practical Reasons • Given key role of ontologies in e-Science and Semantic Web, it Practical Reasons • Given key role of ontologies in e-Science and Semantic Web, it is essential to provide tools and services to help users: – Design and maintain high quality ontologies, e. g. : • Meaningful — all named classes can have instances • Correct — captured intuitions of domain experts • Minimally redundant — no unintended synonyms • Richly axiomatised — (sufficiently) detailed descriptions – Store (large numbers) of instances of ontology classes, e. g. : • Annotations from web pages (or gene product data) – Answer queries over ontology classes and instances, e. g. : • Find more general/specific classes • Retrieve annotations/pages matching a given description – Integrate and align multiple ontologies

Why Decidable Reasoning? • OWL constructors/axioms restricted so reasoning is decidable • Consistent with Why Decidable Reasoning? • OWL constructors/axioms restricted so reasoning is decidable • Consistent with Semantic Web's layered architecture – XML provides syntax transport layer – RDF(S) provides basic relational language and simple ontological primitives – OWL provides powerful but still decidable ontology language – Further layers (e. g. SWRL) will extend OWL • Will almost certainly be undecidable • Facilitates provision of reasoning services – “Practical” algorithms for sound and complete reasoning – Several implemented systems – Evidence of empirical tractability

Why Sound & Complete Reasoning? • Important for ontology design – Ontologists need to Why Sound & Complete Reasoning? • Important for ontology design – Ontologists need to have complete confidence in reasoner – Otherwise they will cease to trust results – Doubting unexpected results makes reasoner useless • Important for ontology deployment – Many realistic web applications will be agent ↔ agent – No human intervention to spot glitches in reasoning • Incomplete reasoning might be OK in 3 -valued system – But “don’t know” typically treated as “no”

Basic Inference Tasks • Knowledge is correct (captures intuitions) – Does C subsume D Basic Inference Tasks • Knowledge is correct (captures intuitions) – Does C subsume D w. r. t. ontology O? (in every model I of O, CI µ DI ) • Knowledge is minimally redundant (no unintended synonyms) – Is C equivallent to D w. r. t. O? (in every model I of O, CI = DI ) • Knowledge is meaningful (classes can have instances) – Is C is satisfiable w. r. t. O? (there exists some model I of O s. t. CI ; ) • Querying knowledge – Is x an instance of C w. r. t. O? (in every model I of O, x. I 2 CI ) – Is hx, yi an instance of R w. r. t. O? (in every model I of O, (x. I, y. I) 2 RI ) • Above problems can be solved using highly optimised DL reasoners

E. g. : Reasoning Support for Ontology Design E. g. : Reasoning Support for Ontology Design

E. g. : Reasoning Support for Instance Retrieval E. g. : Reasoning Support for Instance Retrieval

DL Reasoning: Highly Optimised Implementations • • DL reasoning based on tableaux algorithms Naive DL Reasoning: Highly Optimised Implementations • • DL reasoning based on tableaux algorithms Naive implementation → effective non-termination Modern systems include MANY optimisations Optimised classification (compute partial ordering) – Enhanced traversal (exploits information from previous tests) – Use structural information to select classification order • Optimised subsumption testing (search for models) – – – Normalisation and simplification of concepts Absorption (simplification) of axioms Dependency directed backtracking Caching of satisfiability results and (partial) models Heuristic ordering of propositional and modal expansion …

Research Challenges • Increased expressive power – Existing DL systems implement (at most) SHIQ Research Challenges • Increased expressive power – Existing DL systems implement (at most) SHIQ – OWL extends SHIQ with datatypes and nominals (SHOIN(Dn)) – Future (undecidable) extensions such as SWRL • Scalability – Very large ontologies – Reasoning with (very large numbers of) individuals • Other reasoning tasks – – • Querying Matching Least common subsumer. . . Tools and Infrastructure – Support for large scale ontological engineering and deployment

Summary 1 • DLs are family of object oriented KR formalisms related to frames Summary 1 • DLs are family of object oriented KR formalisms related to frames and Semantic networks – Distinguished by formal semantics and inference services • Semantic Web aims to make web resources accessible to automated processes – Ontologies will play key role by providing vocabulary for semantic markup • OWL is a DL based ontology language designed for the Web – – Exploits existing standards: XML, RDF(S) Adds KR idioms from object oriented and frame systems W 3 C recommendation and already widely adopted in e-Science DL provides formal foundations and reasoning support

Summary 2 • Reasoning is important because – Understanding is closely related to reasoning Summary 2 • Reasoning is important because – Understanding is closely related to reasoning – Essential for design, maintenance and deployment of ontologies • Reasoning support based on DL systems – Sound and complete reasoning – Highly optimised implementations • Challenges remain – – Reasoning with full OWL language (Convincing) demonstration(s) of scalability New reasoning tasks Development of (more) high quality tools and infrastructure

Acknowledgements Thanks to the many people who I have worked with, in particular: – Acknowledgements Thanks to the many people who I have worked with, in particular: – – – Dieter Fensel Frank van Harmelen Peter Patel-Schneider Alan Rector Uli Sattler

Resources • Slides from this talk – http: //www. cs. man. ac. uk/~horrocks/Slides/Sussex • Resources • Slides from this talk – http: //www. cs. man. ac. uk/~horrocks/Slides/Sussex • Fa. CT system (open source) – http: //www. cs. man. ac. uk/Fa. CT/ • Oil. Ed (open source) – http: //oiled. man. ac. uk/ • Protégé – http: //protege. stanford. edu/plugins/owl/ • W 3 C Web-Ontology (Web. Ont) working group (OWL) – http: //www. w 3. org/2001/sw/Web. Ont/ • DL Handbook, Cambridge University Press – http: //books. cambridge. org/0521781760. htm

Select Bibliography • Ian Horrocks, Peter F. Patel-Schneider, and Frank van Harmelen. From SHIQ Select Bibliography • Ian Horrocks, Peter F. Patel-Schneider, and Frank van Harmelen. From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics, 2003. • Franz Baader, Ian Horrocks, and Ulrike Sattler. Description logics as ontology languages for the semantic web. In Festschrift in honor of Jörg Siekmann, LNAI. Springer, 2003. • I. Horrocks and U. Sattler. Ontology reasoning in the SHOQ(D) description logic. In Proc. of IJCAI 2001. All available from http: //www. cs. man. ac. uk/~horrocks/Publications/