Authors:
Frédéric Furst
1
and
Francky Trichet
2
Affiliations:
1
LARIA, University of Amiens, UPJV, France
;
2
LINA, University of Nantes, France
Keyword(s):
Heavyweight Ontology, Axioms, Graph-Based Techniques, Ontology Matching, Conceptual Graphs.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Biomedical Engineering
;
Cloud Computing
;
Data Engineering
;
Enterprise Information Systems
;
Health Information Systems
;
Information Systems Analysis and Specification
;
Knowledge Engineering and Ontology Development
;
Knowledge Management
;
Knowledge-Based Systems
;
Ontologies and the Semantic Web
;
Ontology Engineering
;
Semantic Web Technologies
;
Services Science
;
Society, e-Business and e-Government
;
Software Agents and Internet Computing
;
Symbolic Systems
;
Verification and Validation of Knowledge-Based Systems
;
Web Information Systems and Technologies
Abstract:
Managing multiple ontologies is now a core question in most of the applications that require semantic interoperability. The Semantic Web is surely the most significant application of this report: the current challenge is not to design, develop and deploy domain ontologies but to define semantic correspondences among multiple ontologies covering overlapping domains. In this paper, we introduce a new approach of ontology matching named axiom-based ontology matching. As this approach is founded on the use of axioms, it is mainly dedicated to heavyweight ontologies (an heavyweight ontology is a lightweight ontology, i.e. an ontology simply based on a hierarchy of concepts and a hierarchy of relations, enriched with axioms used to fix the semantic interpretation of concepts and relations), but it can also be applied to lightweight ontologies as a complementary approach to the current techniques based on the analysis of natural language expressions, instances and/or taxonomical structures
of ontologies. This new matching paradigm is defined in the context of the Conceptual Graphs model (CG), where the projection (i.e. the main operator for reasoning with CG which corresponds to homomorphism of graphs) is used as a means to semantically match the concepts and the relations of two ontologies through the explicit representation of the axioms in terms of conceptual graphs. We also introduce an ontology of representation dedicated to the reasoning of heavyweight ontologies at the meta-level.
(More)