Chapter

Ontology Matching

pp 399-405

Conclusions

  • Jérôme EuzenatAffiliated withINRIA and LIG
  • , Pavel ShvaikoAffiliated withInformatica Trentina SpA, while at Department of Engineering and Computer Science (DISI), University of Trento, while at Web of Data, Bruno Kessler Foundation - IRST

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this book, we have attempted at covering ontology matching in its diversity. In particular, we have shown that many applications may need ontology matching (Chap. 1) and that there are different forms of ontologies that may need to be matched (Chap. 2). Based on reasonable methodological rules (Chap. 3), ontology matching can take advantage of innumerable basic (Chap. 5) and advanced (Chap. 6) techniques composed and supervised in diverse ways (Chap. 7). This has led to a profusion of available systems (Chap. 8). The output of matching can be provided according to different representations (Chap. 10) or executable forms (Chap. 12) which may need to be communicated to users (Chap. 11).