@conference {17794,
	title = {A graph theoretical foundation for integrating RDF ontologies},
	booktitle = {PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE},
	volume = {20},
	year = {2005},
	month = {2005///},
	pages = {1442 - 1442},
	abstract = {RDF ontologies are rapidly increasing in number. We studythe problem of integrating two RDF ontologies under a given
set H of Horn clauses that specify semantic relationships be-
tween terms in the ontology, as well as under a given set of
negative constraints. We formally define the notion of a {\textquotedblleft}wit-
ness{\textquotedblright} to the integrability of two RDF ontologies under such
constraints. A witness represents a way of integrating the
ontologies together. We define a {\textquotedblleft}minimal{\textquotedblright} witnesses and
provide the polynomial CROW (Computing RDF Ontology
Witness) algorithm to find a witness. We report on the per-
formance 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.
},
	author = {Udrea,O. and Deng,Y. and Ruckhaus,E. and V.S. Subrahmanian}
}
