NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.032 seconds)
1

Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies

Suntisrivaraporn, Boontawee 05 February 2009 (has links) (PDF)
Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given explicitly. This thesis investigates various reasoning techniques for tractable DLs in the EL family which have been implemented in the CEL system. It suggests that the use of the lightweight DLs, in which reasoning is tractable, is beneficial for ontology design and maintenance both in terms of expressivity and scalability. The claim is supported by a case study on the renown medical ontology SNOMED CT and extensive empirical evaluation on several large-scale biomedical ontologies.
Description Logic
Tractable reasoning
Polynomial algorithms
Biomedical ontologies
Ontology design
CEL reasoner
DL systems
Beschreibungslogik
polynomielle Schlussfolgerung
polynomielle Algorithmen
biomedizinische Ontologien
Ontologie-Entwurf
CEL Reasoner
Beschreibungslogik-Systeme
ddc:004
rvk:ST 134
2

Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies

Suntisrivaraporn, Boontawee 21 January 2009 (has links)
Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given explicitly. This thesis investigates various reasoning techniques for tractable DLs in the EL family which have been implemented in the CEL system. It suggests that the use of the lightweight DLs, in which reasoning is tractable, is beneficial for ontology design and maintenance both in terms of expressivity and scalability. The claim is supported by a case study on the renown medical ontology SNOMED CT and extensive empirical evaluation on several large-scale biomedical ontologies.
info:eu-repo/classification/ddc/004
ddc:004

Page generated in 0.0363 seconds