We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class of problems. According to the tests we have done so far, the optimizations substantially improve the time performance of the system.

Efficient Semantic Matching / Giunchiglia, Fausto; Yatskevich, Mikalai; Giunchiglia, Enrico. - ELETTRONICO. - (2004).

Efficient Semantic Matching

Giunchiglia, Fausto;Yatskevich, Mikalai;
2004-01-01

Abstract

We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class of problems. According to the tests we have done so far, the optimizations substantially improve the time performance of the system.
2004
Trento
Università degli Studi di Trento - Dipartimento di Informatica e Telecomunicazioni
Efficient Semantic Matching / Giunchiglia, Fausto; Yatskevich, Mikalai; Giunchiglia, Enrico. - ELETTRONICO. - (2004).
Giunchiglia, Fausto; Yatskevich, Mikalai; Giunchiglia, Enrico
File in questo prodotto:
File Dimensione Formato  
112.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 188.59 kB
Formato Adobe PDF
188.59 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/359212
 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