• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Algoritmos para Interoperabilidade entre Ontologias / ALGORITHMS FOR ONTOLOGIES INTEROPERABILIT

Hinz, Verlani Timm 06 August 2008 (has links)
Made available in DSpace on 2016-03-22T17:26:09Z (GMT). No. of bitstreams: 1 Verlani Hinz.pdf: 1544192 bytes, checksum: cf6c659e0f4abe594675df0afce948c6 (MD5) Previous issue date: 2008-08-06 / Nowadays the interest for the theme ontologies has steadily increased, as it aims at to capture consensual knowledge between people and applications, allowing reusing and sharing information. With this purpose, mechanisms are demanded to guarantee semantic interoperability, that is, the identification and compatibility of information. The present study proposes to development the algorithms to interoperability among ontologies. Hence, it intends to obtain more semantic flexibility and to reach better levels of description in the information that characterize the context of a computational environment. Initially, a basic but deep study, was done about the ways of interoperability among ontologies and its applications in different environments. Formality of specification as grammatical of graphs and matrix of adjacencies to represent ontologies and the use of parsers for conversion of code OWL in representation of matrices had also been studied. The patterns Dublin Core and FOAF, were studied and used in order to address the issue of reconciliation of vocabularies. For verification of the applicability of the measure, it was shown to an example of dynamic interoperability of ontologies and an algorithm that can be applied in several scenes / Recentemente, tem crescido o interesse sobre o tema Ontologias, pois estas objetivam capturar conhecimento consensual entre pessoas e aplicações, permitindo o reuso e compartilhamento de informações. Para estes propósitos, são necessários mecanismos que garantam a interoperabilidade semântica e compatibilidade de informações. O presente trabalho propõe desenvolver algoritmos para interoperabilidade entre ontologias, utilizando operadores relacionais. Para isso, inicialmente foi feito um estudo básico, mas aprofundado, sobre as formas de interoperabilidade entre ontologias e sua aplicação em diferentes ambientes. Foram estudados também formalismos de especificação como gramática de grafos e matriz de adjacências para representar ontologias, assim como, a utilização de parsers para converter ontologias no formato OWL em representação de matrizes. Os padrões Dublin Core e FOAF, foram estudados e utilizados a fim de tratar a questão da conciliação de vocabulários. Como verificações da aplicabilidade da medida foram demonstrados dois exemplos de interoperabilidade dinâmica de ontologias aplicadas a domínios específicos

Page generated in 0.1538 seconds