{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:40:27Z","timestamp":1725493227502},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441908"},{"type":"electronic","value":"9783540457572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_12","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T17:50:39Z","timestamp":1192902639000},"page":"137-148","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and Algorithms for the Matching of Bag and Set Terms"],"prefix":"10.1007","author":[{"given":"Gianluigi","family":"Greco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ester","family":"Zumpano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0743-1066(95)00146-8","volume":"27","author":"N. Arni","year":"1996","unstructured":"N. Arni, S. Greco and D. Sacc\u00e0, Matching of Bounded Set Terms in the Logic Language LDL++, J. of Logic Programming 27(1): 73\u201387, 1996.","journal-title":"J. of Logic Programming"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"C. Beeri, S. Naqvi, O. Shmueli and S. Tsur, Set Constructors in a Logic Database Language, J. of Logic Programming, Vol. 10, No 3 & 4, 1991.","DOI":"10.1016\/0743-1066(91)90036-O"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"E. Dantsin and A. Voronkov, A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. Proc. Int. Conf. Foundations of Software Science and Computation Structures, 180\u2013196, 1999.","DOI":"10.1007\/3-540-49019-1_13"},{"key":"12_CR4","unstructured":"G. Dowek, Higher-order unification and matching, A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, pp. 1009\u2013106, Elsevier, 2001."},{"key":"12_CR5","unstructured":"A. Dovier, E. G. Omodeo, E. Pontelli and G. F. Rossi,: A Logic Programming Language with Finite Sets, Proc. Int. Conf. on Logic Programming, 111\u2013124, 1991."},{"key":"12_CR6","unstructured":"F. Fages, Associative-Commutative Unification, 8th Int. Conf. on Automated Deduction, pp. 416\u2013430, 1986."},{"key":"12_CR7","volume-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability-A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"S. Greco, Optimal Unification of Bounded Set Terms, Int. Conf. on Information and Knowledge Management, pp. 326\u2013336, 1996.","DOI":"10.1145\/238355.238575"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"G. Greco, S. Greco and E. Zumpano, A logical Framework for the Integration of Databases. Proc. Int. Symp. on Methodologies for Intelligent Sistems, 2002.","DOI":"10.1007\/3-540-48050-1_31"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"N. Immerman, S. Patnaik and D. Stemple, The Expressiveness of a Family of Finite Set Languages, Proc. PODS Conf., 37\u201352, 1991.","DOI":"10.1145\/113413.113417"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0743-1066(92)90005-N","volume":"12","author":"B. Jayaraman","year":"1992","unstructured":"B. Jayaraman, Implementation of Subset-Equational Programs, Journal of Logic Programming, Vol. 12, 299\u2013324, 1992.","journal-title":"Journal of Logic Programming"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"D. Kapur and P. Narendran, NP-completeness of the Set Unification and Matching problems, Proc. Int. Conf. on Automated Deduction, 489\u2013495, 1986.","DOI":"10.1007\/3-540-16780-3_113"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"D. Kapur and P. Narendran, Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers, Proc. LICS Conf., 11\u201321, 1992.","DOI":"10.1109\/LICS.1992.185515"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/62029.62030","volume":"21","author":"K. Knight","year":"1989","unstructured":"K. Knight, Unification: A Multidisciplinary Survey, ACM Comp. Surveys, Vol. 21(1), pp. 93\u2013124, 1989.","journal-title":"ACM Comp. Surveys"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/0022-0000(90)90033-H","volume":"41","author":"G. M. Kuper","year":"1990","unstructured":"G. M. Kuper, Logic Programming with Sets, Journal of Computer and System Science, No. 41(1), pp. 44\u201364, 1990.","journal-title":"Journal of Computer and System Science"},{"key":"12_CR16","unstructured":"W. Ledermann and S. Vajda, Handbook of Applicable Mathematics, Vol. 5(B), 1985."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"C. Lincoln and J. Christian, Adventures in Associative-Commutative Unification, Proc. 9th International Conference on Automated Deduction, pp. 358\u2013367, 1988.","DOI":"10.1007\/BFb0012843"},{"key":"12_CR18","unstructured":"M. Livesey and J.H. Siekmann, Unification of A+C-Terms (Bags) and A+C+ITerms (Sets), Tech. Report, 5\/67, Facultat fur Informatik, Univ. Karlruhe, 1976."},{"key":"12_CR19","unstructured":"C. Mateis, Unification of Simple Set Terms, Master Thesis (in Italian), 1996."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M. S. Paterson","year":"1978","unstructured":"M. S. Paterson, Linear Unification, Journal of Computer and System Science, No. 16, pp. 158\u2013167, 1978.","journal-title":"Journal of Computer and System Science"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90040-A","volume":"12","author":"O. Shmueli","year":"1992","unstructured":"O. Shmueli, S. Tsur and C. Zaniolo, Compilation of Set Terms in the Logic Data Language (LDL), J. of Logic Programming, Vol. 12(1) & 2, 89\u2013119, 1992.","journal-title":"J. of Logic Programming"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J. Siekmann","year":"1989","unstructured":"J. Siekmann, Unification Theory, J. of Symbolic Computation, No. 7, 207\u2013274, 1989.","journal-title":"J. of Symbolic Computation"},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1006019227709","volume":"22","author":"F. Stolzenburg","year":"1999","unstructured":"F. Stolzenburg, An Algorithm for General Set Unification and Its Complexity, Journal of Automated Reasoning, 22(1), pp. 45\u201363, 1999.","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR24","volume-title":"Principles of Database and Knowledge-Base Systems","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."},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0890-5401(92)90075-Q","volume":"101","author":"R. M. Verma","year":"1992","unstructured":"R. M. Verma and I. V. Ramakrishnan, Tight Complexity Bounds for Term Matching Problems, Information and Computation, No. 101(1), 33\u201369, 1992.","journal-title":"Information and Computation"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"C. Zaniolo, N. Arni, K. Ong, Negation and Aggregates in Recursive Rules: the LDL++ Approach. DOOD Conf., pp. 204\u2013221, 1993.","DOI":"10.1007\/3-540-57530-8_13"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:08:07Z","timestamp":1556921287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}