<div dir="ltr"><div class="gmail_quote"><br><div dir="ltr"><span style="font-family:verdana,sans-serif"> The 18th International Workshop on</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> ONTOLOGY MATCHING</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> (OM-2023)</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> <a href="http://om2023.ontologymatching.org/" target="_blank">http://om2023.ontologymatching.org/</a></span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> November 6th or 7th, 2023,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> International Semantic Web Conference (ISWC) Workshop Program,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> M.A.I.C.C., Athens, Greece</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> </span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">BRIEF DESCRIPTION AND OBJECTIVES</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Ontology matching is a key interoperability enabler for the Semantic Web,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">as well as a useful technique in some classical data integration tasks</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">dealing with the semantic heterogeneity problem. It takes ontologies</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">as input and determines as output an alignment, that is, a set of</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">correspondences between the semantically related entities of those ontologies.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">These correspondences can be used for various tasks, such as ontology</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">merging, data interlinking, query answering or navigation over knowledge graphs.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Thus, matching ontologies enables the knowledge and data expressed</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">with the matched ontologies to interoperate.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">The workshop has three goals:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">1.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">To bring together leaders from academia, industry and user institutions</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">to assess how academic advances are addressing real-world requirements.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">The workshop will strive to improve academic awareness of industrial</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">and final user needs, and therefore, direct research towards those needs.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Simultaneously, the workshop will serve to inform industry and user</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">representatives about existing research efforts that may meet their</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">requirements. The workshop will also investigate how the ontology</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">matching technology is going to evolve, especially with respect to</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">data interlinking, knowledge graph and web table matching tasks.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">2.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">To conduct an extensive and rigorous evaluation of ontology matching</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">and instance matching (link discovery) approaches through</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">the OAEI (Ontology Alignment Evaluation Initiative) 2023 campaign:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://oaei.ontologymatching.org/2023/" target="_blank">http://oaei.ontologymatching.org/2023/</a></span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">3.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">To examine similarities and differences from other, old, new and emerging,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">techniques and usages, such as web table matching or knowledge embeddings.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">TOPICS of interest include but are not limited to:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Business and use cases for matching (e.g., big, open, closed data);</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Requirements to matching from specific application scenarios;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Formal foundations and frameworks for matching; </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Novel matching methods, including link prediction, ontology-based access;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching and knowledge graphs;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching and deep learning;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching and embeddings;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching and big data;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching and linked data;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Instance matching, data interlinking and relations between them;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Privacy-aware matching;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Process model matching;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Large-scale and efficient matching techniques;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matcher selection, combination and tuning;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> User involvement (including both technical and organizational aspects);</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Explanations in matching;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Social and collaborative matching;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Uncertainty in matching;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Expressive alignments; </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Reasoning with alignments;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Alignment coherence and debugging;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Alignment management;</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching for traditional applications (e.g., data science);</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> Matching for emerging applications (e.g., web tables, knowledge graphs).</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">SUBMISSIONS</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Contributions to the workshop can be made in terms of technical papers and</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">posters/statements of interest addressing different issues of ontology matching</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">as well as participating in the OAEI 2023 campaign. Long technical papers should</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">be of max. 12 pages. Short technical papers should be of max. 6 pages.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Posters/statements of interest should not exceed 3 pages.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">All contributions have to be prepared using the CEUR-ART, 1-column style.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Overleaf page for LaTeX users is available at</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="https://www.overleaf.com/read/gwhxnqcghhdt" target="_blank">https://www.overleaf.com/read/gwhxnqcghhdt</a>,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">while offline version with the style files is available from</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://ceur-ws.org/Vol-XXX/CEURART.zip" target="_blank">http://ceur-ws.org/Vol-XXX/CEURART.zip</a>.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Submissions should be uploaded in PDF format</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">through the workshop submission site at:</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="https://www.easychair.org/conferences/?conf=om2023" target="_blank">https://www.easychair.org/conferences/?conf=om2023</a></span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Contributors to the OAEI 2023 campaign have to follow the campaign conditions</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">and schedule at <a href="http://oaei.ontologymatching.org/2023/" target="_blank">http://oaei.ontologymatching.org/2023/</a>.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">DATES FOR TECHNICAL PAPERS AND POSTERS:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> July 31st, 2023: Deadline for the submission of papers.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> August 28th, 2023: Deadline for the notification of acceptance/rejection.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> September 4th, 2023: Workshop camera ready copy submission.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> November 6th or 7th, 2023: OM-2023, M.A.I.C.C., Athens, Greece.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Contributions will be refereed by the Program Committee.</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Accepted papers will be published in the workshop proceedings as a volume of CEUR-WS as well as indexed on DBLP.</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">ORGANIZING COMMITTEE</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">1. Pavel Shvaiko (main contact)</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Trentino Digitale, Italy</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">2. Jérôme Euzenat</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">INRIA & Univ. Grenoble Alpes, France</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">3. Ernesto Jiménez-Ruiz</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">City, University of London, UK & SIRIUS, University of Oslo, Norway</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">4. Oktie Hassanzadeh</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">IBM Research, USA</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">5. Cássia Trojahn</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">IRIT, France</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">PROGRAM COMMITTEE:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Alsayed Algergawy, Jena University, Germany</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Manuel Atencia, Universidad de Málaga, Spain</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Jiaoyan Chen, University of Oxford, UK</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Jérôme David, University Grenoble Alpes & INRIA, France</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Gayo Diallo, University of Bordeaux, France</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Daniel Faria, INESC-ID&IST, University of Lisbon, Portugal</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Alfio Ferrara, University of Milan, Italy</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Marko Gulić, University of Rijeka, Croatia</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Wei Hu, Nanjing University, China</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Ryutaro Ichise, National Institute of Informatics, Japan</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Antoine Isaac, Vrije Universiteit Amsterdam & Europeana, Netherlands</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Naouel Karam, Fraunhofer, Germany</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Prodromos Kolyvakis, EPFL, Switzerland</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Patrick Lambrix, Linköpings Universitet, Sweden</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Oliver Lehmberg, University of Mannheim, Germany</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Fiona McNeill, University of Edinburgh, UK</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Hoa Ngo, CSIRO, Australia</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">George Papadakis, University of Athens, Greece</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Catia Pesquita, University of Lisbon, Portugal</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Henry Rosales-Méndez, University of Chile, Chile</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Booma Sowkarthiga, Microsoft, USA</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Kavitha Srinivas, IBM, USA</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Giorgos Stoilos, University of Oxford, UK</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Valentina Tamma, University of Liverpool, UK</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Ludger van Elst, DFKI, Germany</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Xingsi Xue, Fujian University of Technology, China</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Ondřej Zamazal, Prague University of Economics, Czech Republic</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Songmao Zhang, Chinese Academy of Sciences, China</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Lu Zhou, TigerGraph, USA</span><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">-------------------------------------------------------</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">More about ontology matching:</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://www.ontologymatching.org/" target="_blank">http://www.ontologymatching.org/</a></span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://book.ontologymatching.org/" target="_blank">http://book.ontologymatching.org/</a></span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">-------------------------------------------------------</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"> </span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Best Regards,</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Pavel</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">-------------------------------------------------------</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Pavel Shvaiko, PhD</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif">Trentino Digitale, Italy</span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://www.ontologymatching.org/" target="_blank">http://www.ontologymatching.org/</a></span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="https://www.trentinodigitale.it/" target="_blank">https://www.trentinodigitale.it/</a></span><br style="font-family:verdana,sans-serif"><span style="font-family:verdana,sans-serif"><a href="http://www.dit.unitn.it/~pavel" target="_blank">http://www.dit.unitn.it/~pavel</a></span><br></div>
</div></div>
<br>
<div><font face="Arial" size="1">Cap. Soc. Euro 6.433.680,00 - REG. IMP. / C.F. / P.IVA 00990320228</font></div><div><font face="Arial" size="1">E-mail: <a href="mailto:tndigit@tndigit.it" target="_blank">tndigit@tndigit.it</a> - <a href="http://www.trentinodigitale.it" target="_blank">www.trentinodigitale.it</a></font></div><div><font face="Arial" size="1">Società soggetta ad attività di direzione e coordinamento da parte della Provincia Autonoma di Trento - C.Fisc. 00337460224.</font></div><div><font face="Arial" size="1">Questo messaggio è indirizzato esclusivamente ai destinatari in intestazione, può contenere informazioni protette e riservate ai sensi della normativa vigente e ne è vietato qualsiasi impiego diverso da quello per cui è stato inviato. Se lo avete ricevuto per errore siete pregati di eliminarlo in ogni sua parte e di avvisare il mittente</font></div><div style="font-family:Arial,Helvetica,sans-serif;font-size:1.3em"><br></div>