A graph theoretical foundation for integrating RDF ontologies

Authors:
Octavian Udrea;Yu Deng;Edna Ruckhaus;V. S. Subrahmanian
Affiliations:
University of Maryland, College Park, MD;University of Maryland, College Park, MD;Universidad Simon Bolivar, Caracas, Venezuela and Maryland Information and Network Dynamics Laboratory, College Park, MD;University of Maryland, College Park, MD
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Year:
2005

Citing 2
Cited 1

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
FCA-MERGE: bottom-up merging of ontologies

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Towards Lightweight and Robust Large Scale Emergent Knowledge Processing

ISWC '09 Proceedings of the 8th International Semantic Web Conference

Quantified Score

Hi-index	0.00

Visualization

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 Onto-Broker ontologies as well as on synthetically generated data. The experiments show that CROW works very well on real-life ontologies and scales to massive ontologies.