The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic inter-operability across autonomous applications. In this paper we propose an algorithm, called CTX-MATCH, for discovering semantic relations be-tween concepts belonging to heterogeneous and autonomously developed semantic schemas. The most significant innovations of the algorithm, which is theoretically founded on a well–known theory of contextual reasoning in AI, are that (i) the problem of finding relationships between concepts in different schemas is encoded as a problem of logical satisfiability (and so mappings have a well–defined semantic); and (ii) the way linguistic and domain knowledge is used to build the SAT problem. In this paper, we are mainly focused on the first aspect. The algorithm has been implemented as part of a peer-to-peer system for Distributed Knowledge Management, and tested on significant cases.

An algorithm for matching contextualized schemas via SAT / Serafini, Luciano; Bouquet, Paolo; Magnini, Bernardo; Zanobini, Stefano. - ELETTRONICO. - (2003).

An algorithm for matching contextualized schemas via SAT

Serafini, Luciano;Bouquet, Paolo;Magnini, Bernardo;Zanobini, Stefano
2003-01-01

Abstract

The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic inter-operability across autonomous applications. In this paper we propose an algorithm, called CTX-MATCH, for discovering semantic relations be-tween concepts belonging to heterogeneous and autonomously developed semantic schemas. The most significant innovations of the algorithm, which is theoretically founded on a well–known theory of contextual reasoning in AI, are that (i) the problem of finding relationships between concepts in different schemas is encoded as a problem of logical satisfiability (and so mappings have a well–defined semantic); and (ii) the way linguistic and domain knowledge is used to build the SAT problem. In this paper, we are mainly focused on the first aspect. The algorithm has been implemented as part of a peer-to-peer system for Distributed Knowledge Management, and tested on significant cases.
2003
Trento, Italia
Università degli Studi di Trento. DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY
An algorithm for matching contextualized schemas via SAT / Serafini, Luciano; Bouquet, Paolo; Magnini, Bernardo; Zanobini, Stefano. - ELETTRONICO. - (2003).
Serafini, Luciano; Bouquet, Paolo; Magnini, Bernardo; Zanobini, Stefano
File in questo prodotto:
File Dimensione Formato  
003.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 403.52 kB
Formato Adobe PDF
403.52 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/358652
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact