Spelling suggestions: "subject:"polynomiellen algorithmen"" "subject:"polynomiell algorithmen""
1 |
Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical OntologiesSuntisrivaraporn, 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.
|
2 |
Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical OntologiesSuntisrivaraporn, 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.
|
Page generated in 0.0751 seconds