• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Knowledge Representation and Concretization of Underdetermined Data

Skaret, Vegar
Master thesis
View/Open
vegaskar.pdf (1.164Mb)
Year
2020
Permanent link
http://urn.nb.no/URN:NBN:no-83395

Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3608]
Abstract
Data is underdetermined when there are variables whose values are unknown and the legal instantiations of these variables depend on given factors and the corresponding domain knowledge. The problem of instantiating the variables is a combinatorial problem. In this thesis we develop an approach to find all of the legal instantiations based on a specific knowledge formalization. We make use of a popular knowledge representation tool to make the formalization of knowledge for use cases with underdetermined data more accessible to users without programming experience. We argue that the approach is easier to use and to maintain than an alternative approach formalizing knowledge with imperative programming. We formalize a way of representing underdetermined data with an OWL ontology, and develop an algorithm to generate all of the legal instantiations based on the ontology. We also show a way of translating worlds represented in OWL to a representation of worlds in the Maude system. Furthermore, we argue for correctness of the algorithm by proving that it generates sound results and give the intuition for, and partly prove, how it generates complete results. The approach is successfully applied on parts of a use case of petroleum systems. However, the execution time of the implementation is long, and this is likely due to poor computational complexity. We discuss possible approaches to mitigate this issue.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy