{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:13:25Z","timestamp":1776129205124,"version":"3.50.1"},"reference-count":0,"publisher":"Maximum Academic Press","issue":"3","license":[{"start":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T00:00:00Z","timestamp":1084406400000},"content-version":"unspecified","delay-in-days":255,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2003,9]]},"abstract":"<jats:p>\n                    We think of\n                    <jats:italic>match<\/jats:italic>\n                    as an operator that takes two graph-like structures (e.g. database schemas or ontologies) and produces a mapping between elements of the two graphs that correspond semantically to each other. The goal of this paper is to propose a new approach to matching, called\n                    <jats:italic>semantic matching<\/jats:italic>\n                    . As its name indicates, in semantic matching the key intuition is to exploit the model-theoretic information, which is codified in the nodes and the structure of graphs. The contributions of this paper are (i) a rational reconstruction of the major matching problems and their articulation in terms of the more generic problem of matching graphs, (ii) the identification of semantic matching as a new approach for performing generic matching and (iii) a proposal for implementing semantic matching by testing propositional satisfiability.\n                  <\/jats:p>","DOI":"10.1017\/s0269888904000074","type":"journal-article","created":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T06:51:23Z","timestamp":1084431083000},"page":"265-280","source":"Crossref","is-referenced-by-count":131,"title":["Semantic matching"],"prefix":"10.48130","volume":"18","author":[{"given":"FAUSTO","family":"GIUNCHIGLIA","sequence":"first","affiliation":[]},{"given":"PAVEL","family":"SHVAIKO","sequence":"additional","affiliation":[]}],"member":"27968","published-online":{"date-parts":[[2004,5,13]]},"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888904000074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:43:20Z","timestamp":1767624200000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888904000074\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0269888904000074"],"URL":"https:\/\/doi.org\/10.1017\/s0269888904000074","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}