1 / 30

Small is Again Beautiful in Description Logics

Small is Again Beautiful in Description Logics. Franz Baader TU Dresden, Germany. Green. Leaf. Tree. Kermit. one of the origins of DLs. Semantic networks. [Quillian, 1967]. Animal. IS-A. has-color. Frog. has-color. IS-A. IS-A. has-part. sits-on. Problems.

zada
Télécharger la présentation

Small is Again Beautiful in Description Logics

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. Small is Again Beautiful in Description Logics Franz Baader TU Dresden, Germany

  2. Green Leaf Tree Kermit one of the origins of DLs Semantic networks [Quillian, 1967] Animal IS-A has-color Frog has-color IS-A IS-A has-part sits-on

  3. Problems with Semantic Networks

  4. Green Ambiguities in Semantic Networks Animal IS-A color Frog

  5. Green Ambiguities resolved in DLs Animal IS-A color Frog

  6. Description logic system structure

  7. Complexity of reasoning tractability barrier

  8. expressive DL sound, but incomplete tractable algorithms expressive DL sound and complete intractable algorithms Ways out of this dilemma inexpressive DL sound and complete tractable algorithms approach followed by main-stream DL research in the last 15 years

  9. expressive DL sound, but incomplete tractable algorithms expressive DL sound and complete intractable algorithms Ways out of this dilemma inexpressive DL sound and complete tractable algorithms

  10. Description Logics research of the last 20 years

  11. Light-weight DLs • subsumption and classification tractable • sufficient expressive power for life-science ontologies

  12. Value restrictionsvs existential restrictions in DLs

  13. Formal semantics

  14. Subsumption

  15. Complexityofsubsumption

  16. Extension

  17. Extension

  18. Extension

  19. CEL

  20. Light-weight DLs • query answering using relational database systems • sufficient expressive power to capture conceptual modelling formalisms

  21. Conjunctivequery

  22. Query answering

  23. Query answering

  24. Query answering

  25. Questions?

More Related