• DocumentCode
    537622
  • Title

    Ontology Integration Equality and Strong Bisimulation

  • Author

    Ji Shu-bin ; Zhang Yin-fa

  • Author_Institution
    Dept. of Comput. Sci., Xi´an Univ. of Posts & Telecommun., Xi´an, China
  • Volume
    1
  • fYear
    2010
  • fDate
    23-24 Oct. 2010
  • Firstpage
    353
  • Lastpage
    356
  • Abstract
    In this paper, we show that strong bisimulation can be used to resolve ontology integration equality. We discuss ontology integration similarity relation, and discuss the definition of ontology integration equality. Then, from the definition of strong bisimulation, we prove that strong bisimulation is an equivalence relation. We also illustrate the transition graphs of strong bisimulation by an example, examining the transitions with three cases. Finally, we discuss the relation between ontology integration equality and strong bisimulation in detail. Thus we show that strong bisimulation can be used to resolve ontology integration equality.
  • Keywords
    graph theory; ontologies (artificial intelligence); process algebra; equivalence relation; ontology integration equality; ontology integration similarity relation; strong bisimulation definition; transition graphs; equality; examining; ontology integration; similarity; strong bisimulation; transition graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Web Information Systems and Mining (WISM), 2010 International Conference on
  • Conference_Location
    Sanya
  • Print_ISBN
    978-1-4244-8438-6
  • Type

    conf

  • DOI
    10.1109/WISM.2010.160
  • Filename
    5662844