Your SlideShare is downloading. ×
0
Modular Ontologies: the Package-based Description Logics Approach
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Modular Ontologies: the Package-based Description Logics Approach

1,093

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,093
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
11
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Artificial Intelligence Research Laboratory Computational Intelligence, Learning, and Discovery Program Department of Computer Science, Iowa State University Modular Ontologies: the Package-based Description Logics Approach Acknowledgements : This research was supported in part by a grant from the US National Science Foundation (IIS-0639230) and support from the USDA Bioinformatics Coordination Project. Jie Bao and Vasant Honavar ABSTRACT Modularity in ontologies is required in many application scenarios, such as collaborative ontology building, partial ontology reuse, selective knowledge hiding, and distributed data management. Consequently, there is an urgent need for ontology languages with features such as localized semantics, partial reusability, well-structured organization and flexible knowledge scope limitation. This study will investigate a new modular ontology language, Package-based Description Logics (P-DL). In P-DL, an ontology is composed of a collection of modules called packages . Different from existing modular ontology language proposals that adopt the “linking” approach, P-DL adopts a selective “importing” mechanism to create semantic connections between ontology modules. The semantics of P-DL relaxes the strong local domain disjointness adopted in existing approaches. Consequently, P-DL has stronger expressivity and overcomes many semantic difficulties presented in existing approaches. This poster will present preliminary results on the syntax, semantics, and the reasoning algorithm of P-DL ontologies. SUMMARY
    • We present an expressive module ontology language, Package-based Description Logics (P-DL)
    • Semantics of P-DL allows local models of ontology modules to be partially overlapping thus solves many problems presented in existing approaches.
    • We give a federated reasoning algorithm for P-DL that can do inference without a global semantics, thus also avoids ( usually costly) ontology integration.
    2 – P-DL Features 3 – Reasoning with P-DL
    • P-DL Semantics:
    • Each package has a local model (a possible world that conforms the logic of the package)
    • Local models may be partially overlapping
    • Solves problems in existing proposals, e.g., expressivity limitations, modules transitive reusability, inter-module unsatisfiability.
    REFERENCES
    • J. Bao, D. Caragea, and V. Honavar. (2006) On the Semantics of Linking and Importing in Modular Ontologies. accepted by the International Semantic Web Conference (ISWC) 2006.
    • J. Bao, D. Caragea, and V. Honavar. (2006) Modular ontologies - a formal investigation of semantics and expressivity. 2006. In the Asian Semantic Web Conference (ASWC2006) (In Press).
    • J. Bao, D. Caragea, and V. Honavar. (2006) A distributed tableau algorithm for package-based description logics. In the 2nd International Workshop On Context Representation And Reasoning (CRR 2006) (In Press). 2006.
    • J. Bao, D. Caragea, and V. Honavar. (2006) Towards collaborative environments for ontology construction and sharing. In International Symposium on Collaborative Technologies and Systems (CTS 2006) . 2006.
    • Ontology:
    • (formally) shared specification of conceptualization
    • (Informally) a term set and relations between terms
    • Modular Ontology:
    • An ontology that consists of multiple modules
    Aug 17, 2006 Fig 1: Modular Ontology Application Example: Collaborative Ontology Building
    • Limitations in existing ontology languages:
    • No support for localized semantics – reasoning only with a single ontology
    • Reuse all or nothing of an ontology
    • Do not allow fine-grained organizational structure
    • Do not allow partial knowledge hiding – everything is “public”
    • Result in unstructured, hard-to-build, hard-to-reuse, intractable ontologies!
    P 3 protected 1. Whole ontology consists of a set of packages 2. Packages are organized in hierarchies 3. Terms and axioms are defined in packages with scope limitations P 1 P 2 public private P 1 P 2 public private P-DL: Package-based Description Logics, a modular ontology language that has the following features: Fig 2: P-DL Features Fig 3: (a) Whole ontology consists of a set of packages, one package can import terms from another package (b) A concrete example given in P-DL (arrows indicate importing relations) (a) (b)
    • A nested package is a part of another package
    • Could be used to represent the organizational structure of an ontology
      • Arrange knowledge
      • Enforce hierarchical management of knowledge
    Packages Package Hierarchy Fig 4: Package Hierarchy Scope Limitation
    • Scope Limitation Modifier (SLM) defines the visible scope of a term or axiom
    • Eg. Public, Private, Protected
    Fig 5: (a) There are local models for each package that are connected by “domain relations” (arrows in figure); (b) A global model can be obtained from those partially overlapping local models Fig 6: Reasoning with P-DL. There are multiple local reasoners each for one package. Each local reasoner maintains a local tableau which is a “projection” of the global tableau. Connections between local tableaux is created by a set of messages. Reasoning with P-DL: constructing a (virtual) global model (represented by a “tableau” tree in the reasoning algorithm) by constructing multiple local tableaux using a federation of local reasoners. 1 – Construction of a Non-Redundant Dataset of RNA-Binding Proteins 1 – Motivation Swine Cattle Chicken Horse Each group works on an ontology module for a particular species (according to the group’s best expertise) Collaborative building of an animal trait ontology that involves multiple research groups across the world General Pet Wild Livestock Animal ontology PetDog Pet Dog General O 1 (General Animal) O 2 (Pet) General Pet Dog Animal ontology x x’ Δ I 1 Δ I 2 C I 1 C I 2 r 12 Δ I 3 r 13 r 23 x’’ C I 3 x C I (a) (b) x 1 {A 1 ,B 1 } {A 2 } {A 3 ,B 3 } {B 2 } x 2 x 3 x 4 x 1 {A 1 } {A 2 } {A 3 } x 2 x 4 x 1 {B 1 } {B 3 } {B 2 } x 3 x 4 The (conceptual) global tableau Local Reasoner for package A Local Reasoner for package B

×