{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:31Z","timestamp":1725559171885},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261247"},{"type":"electronic","value":"9783540315476"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11431053_19","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:48:34Z","timestamp":1279082914000},"page":"272-289","source":"Crossref","is-referenced-by-count":32,"title":["Efficient Semantic Matching"],"prefix":"10.1007","author":[{"given":"Fausto","family":"Giunchiglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikalai","family":"Yatskevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-39718-2_9","volume-title":"The Semantic Web - ISWC 2003","author":"P. Bouquet","year":"2003","unstructured":"Bouquet, P., Serafini, L., Zanobini, S.: Semantic Coordination: A new approach and an application. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol.\u00a02870, pp. 130\u2013145. Springer, Heidelberg (2003)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Do, H., Rahm, E.: COMA - A system for Flexible Combination of Schema Matching Approaches. In: Proceedings of VLDB 2002 (2002)","DOI":"10.1016\/B978-155860869-6\/50060-3"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Giunchiglia, E., Sebastiani, R.: Applying the Davis-Putnam procedure to non-clausal formulas. In: AIIA 1999 (1999)","DOI":"10.1007\/3-540-46238-4_8"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Giunchiglia, F., Shvaiko, P.: Semantic Matching. In The Knowledge Engineering Review Journal 18(3) (2003)","DOI":"10.1017\/S0269888904000074"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-25956-5_5","volume-title":"The Semantic Web: Research and Applications","author":"F. Giunchiglia","year":"2004","unstructured":"Giunchiglia, F., Shvaiko, P., Yatskevich, M.: S-Match: An algorithm and an implementation of semantic matching. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol.\u00a03053, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"19_CR7","unstructured":"Giunchiglia, F., Yatskevich, M.: Element level semantic matching. In: Proceedings of Meaning Coordination and Negotiation workshop at ISWC (2004)"},{"key":"19_CR8","unstructured":"Le Berre, D.: JSAT: The java satisfiability library, http:\/\/cafe.newcastle.edu.au\/daniel\/JSAT\/"},{"key":"19_CR9","unstructured":"Le Berre, D.: SAT4J: A satisfiability library for Java, http:\/\/www.sat4j.org\/"},{"key":"19_CR10","unstructured":"Madhavan, J., Bernstein, P., Rahm, E.: Generic Schema Matching with Cupid. In: VLDB 2001 (2001)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Magnini, B., Speranza, M., Girardi, C.: A Semantic-based Approach to Interoperability of classification Hierarchies: Evaluation of Linguistic Techniques. In: Proceedings of COLING 2004, Geneva, Switzerland, August 23-27 (2004)","DOI":"10.3115\/1220355.1220518"},{"key":"19_CR12","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity Flooding: A Versatile Graph Matching Algorithm. In: Proceedings of ICDE, pp. 117-128 (2002)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Melnik, S., Rahm, E., Bernstein, P.: Rondo: A programming platform for generic model management. In: Proceedings of SIGMOD 2003, pp. 193\u2013204 (2003)","DOI":"10.1145\/872757.872782"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D. Plaisted","year":"1986","unstructured":"Plaisted, D., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation\u00a02, 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR15","unstructured":"Tsetin, G.: On the complexity proofs in propositional logics. Seminars in Mathematics, 8 (1970)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web: Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11431053_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:54Z","timestamp":1605643074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11431053_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261247","9783540315476"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11431053_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}