FONTE: factorizing ONTology engineering complexity
Proceedings of the 2nd international conference on Knowledge capture
Complex semantic web ontology mapping
Web Intelligence and Agent Systems
DODO: a mechanism helping to dynamically construct domain ontologies for services integration
Proceedings of the 2006 international workshop on Service-oriented software engineering
Bottom-Up Extraction and Trust-Based Refinement of Ontology Metadata
IEEE Transactions on Knowledge and Data Engineering
Multidimensional service-oriented ontology mapping
International Journal of Web Engineering and Technology
A framework to specify, extract and manage topic maps driven by ontology
Proceedings of the 26th annual ACM international conference on Design of communication
Advanced ontology management system for personalised e-Learning
Knowledge-Based Systems
RDFSculpt: managing RDF schemas under set-like semantics
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
| Hi-index | 0.00 |
Resolving heterogeneity among the various biological information systems is a crucial problem if we wish to gain value from the many distributed resources available to us. For example, information from multiple protein databases (e.g., Swiss-Prot and PDB) might need to be composed to answer queries posed by end-users. Problems of hetero-geneity in hardware, operating systems, interfaces and data structures have been widely addressed, but issues of diverse semantics have been handled mainly in an ad-hoc fash-ion. This paper highlights the ONION (ONtology compositION) system that enables semantic interoperation among various information sources by articulating the ontologies associated with them. An articulation focuses on the semantically relevant intersection of information resources. Al-though the generation of articulations (semantic correspondences between the ontologies) cannot be fully automated, we take a semi-automatic approach. ONION uses heuristic algorithms for the automatic generation of suggested articulations. This paper outlines an algebra for ontology composition based on their articulations. We show the properties of the algebraic operators and how they depend upon the articulation functions that generate the articulations. Query optimization is enabled based on the properties of the algebraic operators.