Conceptual and formal specifications of reusable problem-solving methods: a
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|conceptual and formal specifications of reusable problem-solving methods: a }}
- [[]]
bibtex
{{#vardefine:pagename|Conceptual and formal specifications of reusable problem-solving methods: a }}{{#vardefine:key| }}
abstract: The identification of reusable problem-solving methods can improve knowledgeengineering by allowing developers to design reasoners quickly frompreexisting components. An important factor for successful method reuse isthe specification of preexisting methods. The PROTEGE-II approach allowsdevelopers to select methods from a library, and to map methods to a domainontology. KARL is a formal and executable knowledge-specification languagethat provides modeling primitives for expressing problem-solving methods. Inthis paper, we show how the code and informal descriptions of problem-solvingmethods in PROTEGE-II can be supplemented with the formal method definitionsin KARL. For our case study, we have chosen two methods from the PROTEGE-IIframework: chronological backtracking and its task specific refinement: theboard-game method. Therefore, we give insights in the development oftask-specific (i.e., strong) problem-solving methods starting withgeneral-purpose methods. We also show how such a task-specific method can beadapted to a given domain.
download:
- paper:
- slides:
| Abstract | The identification of reusable problem-sol … The identification of reusable problem-solving methods can improve knowledgeengineering by allowing developers to design reasoners quickly frompreexisting components. An important factor for successful method reuse isthe specification of preexisting methods. The PROTEGE-II approach allowsdevelopers to select methods from a library, and to map methods to a domainontology. KARL is a formal and executable knowledge-specification languagethat provides modeling primitives for expressing problem-solving methods. Inthis paper, we show how the code and informal descriptions of problem-solvingmethods in PROTEGE-II can be supplemented with the formal method definitionsin KARL. For our case study, we have chosen two methods from the PROTEGE-IIframework: chronological backtracking and its task specific refinement: theboard-game method. Therefore, we give insights in the development oftask-specific (i.e., strong) problem-solving methods starting withgeneral-purpose methods. We also show how such a task-specific method can beadapted to a given domain. ic method can beadapted to a given domain. |
| Address | Stanford, CA, USA + |
| Author | Dieter Fensel +, Henrik Eriksson +, Mark A. Musen +, and Rudi Studer + |
| Bibtype | techreport + |
| Institution | Knowledge Systems, AI Laboratory + |
| Key | KSL-96-07 + |
| Month | February + |
| Note | Medical Computer Science + |
| Number | KSL-96-07 + |
| Tag | Computer science + |
| Title | Conceptual and Formal Specifications of Reusable Problem-Solving Methods: A + |
| Tr id | KSL-96-07 + |
| Year | 1996 + |
