Lightweight ontology

A lightweight ontology is an ontology or knowledge organization system in which concepts are connected by rather general associations than strict formal connections. Examples of lightweight ontologies include associative network and multilingual classifications but the term is not used consistently.

Following the approach described in [1] and exploiting dedicated Natural language processing (NLP) techniques tuned to short phrases (for instance, as described in [2]), each node label can be translated into an unambiguous formal expression, i.e. into a propositional Description Logic (DL) expression. As a result, lightweight ontologies, or formal classifications, are tree-like structures where each node label is a language-independent propositional DL formula codifying the meaning of the node. Taking into account its context (namely the path from the root node), each node formula is subsumed by the formula of the node above. As a consequence, the backbone structure of a lightweight ontology is represented by subsumption relations between nodes. For example, in case a node labeled “car” is under a node labeled “red” we can say that the meaning of the node “car” is “red car” in this case. This is translated into the logical formula “red AND car”.[1] provides some examples of lightweight ontologies.[3] and [4] show how lightweight ontologies can be used to automate important tasks, in particular to favor interoperability among different knowledge organization systems.[5] is an example of how a lightweight ontology can be used selectively for information exchange and service interoperability in time-critical decision support systems.

See also


  1. 1 2 F. Giunchiglia, M. Marchese and I. Zaihrayeu (2006). Encoding classifications into lightweight ontologies. University of Trento Technical Report # DIT-06-016, March 2006
  5. Poslad, S.; Middleton S. E.; Chaves F.; Tao R.; Necmioglu O.; Bügel U. (2015). "A Semantic IoT Early Warning System for Natural Environment Crisis Management". IEEE Transaction on Emerging Topics in Computing (TETC). 3 (2): 246–257.
This article is issued from Wikipedia - version of the 5/18/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.