A graph theoretical foundation for integrating RBF ontologies

Qctavian Udrea*, Yu Deng, Edna Ruckhaus, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

RDF ontologies are rapidly increasing in number. We study the problem of integrating two RDF ontologies under a given set H of Horn clauses that specify semantic relationships between terms in the ontology, as well as under a given set of negative constraints. We formally define the notion of a "witness" to the integrability of two RDF ontologies under such constraints. A witness represents a way of integrating the ontologies together. We define a "minimal" witnesses and provide the polynomial CROW (Computing RDF Ontology Witness) algorithm to find a witness. We report on the performance of CROW both on DAML, SchemaWeb and OntoBroker ontologies as well as on synthetically generated data. The experiments show that CROW works very well on reallife ontologies and scales to massive ontologies.

Original languageEnglish (US)
Pages1442-1447
Number of pages6
StatePublished - 2005
Externally publishedYes
Event20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 - Pittsburgh, PA, United States
Duration: Jul 9 2005Jul 13 2005

Other

Other20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05
Country/TerritoryUnited States
CityPittsburgh, PA
Period7/9/057/13/05

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A graph theoretical foundation for integrating RBF ontologies'. Together they form a unique fingerprint.

Cite this