This thesis focuses on reusing domain ontologies and generic problem solvers (PSs) in the development of new Knowledge Based Systems (KBSs). A two-stage methodology for achieving this has been developed: in the first stage, knowledge is mapped from a domain ontology to the requirements of a generic PS (expressed in a PS ontology); in the second stage, this mapped knowledge and the domain specific reasoning requirements of the generic PS are used to “drive” by the PS. This acquired knowledge can then be used to generate an executable KBS. Developing this methodology involved a detailed review of the earlier reuse literature, in order to understand the strengths and weaknesses of earlier approaches. Generic PSs for propose-and-revise design and diagnosis were also developed based on two existing KBSs which performed these tasks in the elevator domain. To gain insights into the KBS development process, the generic PSs were used to manually build two new executable KBSs. A tool MAKTab, was then developed to support the methodology by semi-automatically performing the actions undertaken during the manual building of the two KBSs. MAKTab has been used to successfully recreate the two elevator systems, and fully develop diagnosis and design KBSs in the computer hardware domain. The findings described in the thesis support the belief that a domain ontology developed for one type of PS will, in general, be unable to fully meet the procedural requirements of another type of PS; this knowledge must therefore be acquired. This work also shows that a single, general knowledge acquisition technique can be applied with different types of generic PSs, to acquire the necessary procedural knowledge.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:499319 |
| Date | January 2009 |
| Creators | Corsar, David |
| Publisher | University of Aberdeen |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=25800 |
Page generated in 0.0016 seconds