Despite the many clear advantages that ontology has to offer as a standardized knowledge representation language, many intelligent system developers still find it difficult to jump on the band wagon and represent all their application knowledge using ontology. This difficulty and hesitation stems primarily from the fact that, while most ontology languages provide native support for reasoning about the domain's structures, they do not provide adequate support for computational planning -- the kind of reasoning used by many intelligent systems to derive their purposeful behaviors.
To overcome this challenge, a lot of work has been done to discover a practical way to seamlessly incorporate planning into ontology languages. As it has been well-established in the literature however, this is a very challenging task from both a theoretical and practical stand point, and many of the reported works in this direction either have had very limited success, or have been done in ad hoc and less reusable manners.
In this thesis, we report our pursuit of a new approach to integrating planning into ontology-driven applications. This approach promises to overcome the difficulties faced by many of the existing approaches. In addition to producing a reusable and extensible framework for doing computational planning in ontology-driven applications, our pursuit also raises and answers some interesting ontology research questions that could have potential impacts on several application domains beyond the integration of planning and ontological modeling.
Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OGU.10214/7378 |
Date | 19 August 2013 |
Creators | Pham, Huy |
Contributors | Stacey, Deborah |
Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
Language | English |
Detected Language | English |
Type | Thesis |
Rights | Attribution-NonCommercial-NoDerivs 2.5 Canada, http://creativecommons.org/licenses/by-nc-nd/2.5/ca/ |
Page generated in 0.0019 seconds