1 / 27

An Introduction to Description Logics (chapter 2 of DLHB)

An Introduction to Description Logics (chapter 2 of DLHB). 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

elmo-wyatt
Download Presentation

An Introduction to Description Logics (chapter 2 of DLHB)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. An Introduction to Description Logics(chapter 2 of DLHB)

  2. 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)

  3. Origions of DLs • Knowledge connecting persons, parents, etc. • Described as semantic network • Semantic networks whitout a semantics

  4. DL Architecture Knowledge Base Tbox (schema) Man ´ Human u Male Happy-Father ´ Man u9 has-child Female u … Interface Inference System Abox (data) John : Happy-Father hJohn, Maryi : has-child

  5. 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 ExpTime logics (e.g., FaCT, DLP, Racer) • Relationship to modal logic and decidable fragments of FOL

  6. 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 (and Grid) • Ontology engineering (design, maintenance, integration) • Reasoning with ontology-based markup (meta-data) • Service description and discovery • Commercial implementations • Cerebra system from Network Inference Ltd

  7. Description Logic Family • DLs are a family of logic based KR formalisms • Particular languages mainly characterised by: • Set of constructors for building complex concepts and roles from simpler ones • Set of axioms for asserting facts about concepts, roles and individuals • Simplest logic in this family is named AL • Others are specified by adding some suffixes like U ε N C: • ALC • ALCU • etc.

  8. Description logic AL • Example constructs:

  9. More AL family members • Disjunction (U) • Full existential quantification (ε) • Number restrictions (N) • Full negation (C) • Example:

  10. Other DL Concept and Role Constructors • Range of other constructors found in DLs, including: • Qualified number restrictions, e.g., £2 hasChild.Female, ³1 hasParent.Male • Nominals (singleton concepts), e.g., {Italy} • Inverse roles, e.g., hasChild¯ (hasParent) • Transitive roles, e.g., hasChild* (descendant) • Role composition, e.g., hasParent o hasBrother (uncle)

  11. DL as fragments of Predicate Logic

  12. Lisp like style for DL

  13. DL Knowledge Base • DL Knowledge Base (KB) normally separated into 2 parts: • TBox is a set of axioms describing structure of domain (i.e., a conceptual schema), e.g.: • HappyFather  Man ÍhasChild.Female Π … • Elephant Í Animal Π Large Π Grey • transitive(ancestor) • ABox is a set of axioms describing a concrete situation (data), e.g.: • John:HappyFather • <John,Mary>:hasChild

  14. Terminologies or TBoxes

  15. Terminologies or Tboxes (cont.)

  16. Inference services

  17. Inference service: concept satisfiability

  18. Inference services based on satisfiability

  19. Inference service: concept subsumption

  20. Concept examples

  21. Example taxonomy

  22. World description: ABox

  23. ABox inference services

  24. Abox inference services (cont.)

  25. ABox example

  26. TBox taxonomy plus individuals

  27. Open world assumption

More Related