Results 1 -
1 of
1
A probabilistic extension to ontology language owl
- In Proceedings of the 37th Hawaii International Conference On System Sciences (HICSS-37), Big Island
, 2004
"... With the development of the semantic web activity, ontologies become widely used to represent the conceptualization of a domain. However, none of the existing ontology languages provides a means to capture uncertainty about the concepts, properties and instances in a domain. Probability theory is a ..."
Abstract
-
Cited by 112 (3 self)
- Add to MetaCart
With the development of the semantic web activity, ontologies become widely used to represent the conceptualization of a domain. However, none of the existing ontology languages provides a means to capture uncertainty about the concepts, properties and instances in a domain. Probability theory is a natural choice for dealing with uncertainty. Incorporating probability theory into existing ontology languages will provide these languages additional expressive power to quantify the degree of the overlap or inclusion between two concepts, support probabilistic queries such as finding the most probable concept that a given description belongs to, and make more accurate semantic integration possible. One approach to provide such a probabilistic extension to ontology languages is to use Bayesian networks, a widely used graphic model for knowledge representation under uncertainty. In this paper, we present our on-going research on extending OWL, an ontology language recently proposed by W3C’s Semantic Web Activity. First, the language is augmented to allow additional probabilistic markups, so probabilities can be attached with individual concepts and properties in an OWL ontology. Secondly, a set of translation rules is defined to convert this probabilistically annotated OWL ontology into a Bayesian network. Our probabilistic extension to OWL has clear semantics: the Bayesian network obtained will be associated with a joint probability distribution over the application domain. General Bayesian network inference procedures (e.g., belief propagation or junction tree) can be used to compute P(C | e): the degree of the overlap or inclusion between a concept C and a concept represented by a description e. We also provide a similarity measure that can be used to find the most probable concept that a given description belongs to. 1.