{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:45Z","timestamp":1725664005423},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560395"},{"type":"electronic","value":"9783540473602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56039-4_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:55:39Z","timestamp":1330253739000},"page":"436-449","source":"Crossref","is-referenced-by-count":1,"title":["Set-term matching in logic programming"],"prefix":"10.1007","author":[{"given":"Natraj","family":"Arni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Sacc\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and S. Grumbach, COL: A logic-based language for complex objects, Proc. EDBT, pp. 271\u2013293, 1988.","DOI":"10.1007\/3-540-19074-0_58"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and P. Kanellekis, Object Identity as a Query language primitive, Proc. ACM SIGMOD Conf. on Management of Data, 1989.","DOI":"10.1145\/67544.66941"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"C. Beeri, S. Naqvi, O. Shmueli and S. Tsur, Set Constructors in a Logic Database Language, Journal of Logic Programming, Vol. 10, No 3 & 4, Apr.May, 1991.","DOI":"10.1016\/0743-1066(91)90036-O"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"W. Buttner, Unification in the Data Structure Sets, Proc. 8th Int. Conf. on Automated Deduction, 1986, pp. 470\u2013488.","DOI":"10.1007\/3-540-16780-3_112"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"C. Dwork, P. C. Kanellakis, and J. C. Mitchell, On the Sequential Nature of Unification, Proc. 8th Int. Conf. on Automated Deduction, 1986, pp. 416\u2013430.","DOI":"10.1007\/3-540-16780-3_109"},{"issue":"No1","key":"29_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"11","author":"C. Dwork","year":"1985","unstructured":"C. Dwork, P. C. Kanellakis, and J. C. Mitchell, Parallel Algorithm for Term Matching, Journal of Logic Programming, Vol. 11, No 1, Jan. 1985, pp. 35\u201350.","journal-title":"Journal of Logic Programming"},{"key":"29_CR7","unstructured":"F. Fages, Associative-Commutative Unification, Proc. 8th Int. Conf. on Automated Deduction, 1986, pp. 416\u2013430."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"N. Immerman, S. Patnaik and D. Stemple, The Expressiveness of a Family of Finite Set Languages, Proc. of the Tenth ACM Symposium on Principles of Database Systems, pages 37\u201352, 1991.","DOI":"10.1145\/113413.113417"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"D. Kapur and P. Narendran, NP-completeness of the Set Unification and Matching problems, Proc. 8th Int. Conf. on Automated Deduction, 1986, pp. 489\u2013495.","DOI":"10.1007\/3-540-16780-3_113"},{"issue":"No.1","key":"29_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/62029.62030","volume":"21","author":"K. Knight","year":"1989","unstructured":"K. Knight, Unification: A Multidisciplinary Survey, ACM Computing Surveys, Vol. 21, No. 1, pages 93\u2013124, March 1989.","journal-title":"ACM Computing Surveys"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0022-0000(90)90033-H","volume":"No. 41","author":"G. M. Kuper","year":"1990","unstructured":"G. M. Kuper, Logic Programming with Sets, Journal of Computer and System Science, No. 41, pages 44\u201364, 1990.","journal-title":"Journal of Computer and System Science"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, M.J. Maher and K. Marriot, Unification Revisited, in Foundations of Deductive Databases and Logic Programming, (J. Minker ed.), Morgan-Kaufman, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"29_CR13","unstructured":"The LVL + + users manual, MCC Technical Report, 1992."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"C. Lincoln and J. Christian, Adventures in Associative-Commutative Unification, Proc. 9th International Conference on Automated Deduction, 1988, pp. 358\u2013367.","DOI":"10.1007\/BFb0012843"},{"key":"29_CR15","unstructured":"M Livesey and J.H. Siekmann, Unification of A+C-Terms (Bags) and A+C+I-Terms (Sets), Technical Report, 5\/67, Facultat fur Informatik, Univ. Karlruhe, 1976."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"J. Lloyd, Foundation of Logic Programming, Second Edition, Spinger-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"29_CR17","unstructured":"S. Naqvi and S. Tsur, A logical Language for Data and Knowledge Bases, Computer Science Press, 1989."},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"No. 7","author":"J. Siekmann","year":"1989","unstructured":"J. Siekmann, Unification Theory, Journal of Symbolic Computation, No. 7, pages 207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"issue":"No.3","key":"29_CR19","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"M.E. Stickel","year":"1981","unstructured":"M.E. Stickel, A Unification Algorithm for Associative-Commutative Functions, Journal of ACM Vol. 28, No. 3, 1981, pp. 423\u2013434.","journal-title":"Journal of ACM"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"O. Shmueli, S. Tsur and C. Zaniolo, Compilation of Set Terms in the Logic Data Language (LDL), Journal of Logic Programming, Vol. 12, No 1 & 2, Jan.Feb., 1992.","DOI":"10.1016\/0743-1066(92)90040-A"},{"key":"29_CR21","unstructured":"S. Tsur and C. Zaniolo, LDL: A Logic Based Data Language Proc. 12th Conference on Very Large Data Bases, 1986."},{"key":"29_CR22","volume-title":"Principles of Database and Knowledge-Base Systems, Vol. 1","author":"J.K. Ullman","year":"1988","unstructured":"J.K. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 1, Computer Science Press, Rockville, Md., 1988."},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"K. Vadaparty, On the power of Rule-Based Languages with Sets, Proc. of the Tenth ACM Symposium on Principles of Database Systems, pages 26\u201336, 1991.","DOI":"10.1145\/113413.113416"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56039-4_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:48Z","timestamp":1605646968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56039-4_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560395","9783540473602"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-56039-4_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}