{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:23Z","timestamp":1725664703092},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:00:41Z","timestamp":1330297241000},"page":"56-66","source":"Crossref","is-referenced-by-count":8,"title":["Complexity of query answering in logic databases with complex values"],"prefix":"10.1007","author":[{"given":"Evgeny","family":"Dantsin","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103140.103141","volume":"16","author":"S. Abiteboul","year":"1991","unstructured":"S. Abiteboul and S. Grumbach. A rule-based language with functions and sets. ACM Transactions on Database Systems, 16(1):1\u201330, 1991.","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/BF01354881","volume":"4","author":"S. Abiteboul","year":"1995","unstructured":"S. Abiteboul and C. Beeri. The power of languages for the manipulation of complex values. VLDB Journal, 4:727\u2013794, 1995.","journal-title":"VLDB Journal"},{"key":"7_CR3","first-page":"493","volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt. Logic programming. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 10, pages 493\u2013574. Elsevier Science, Amsterdam, 1990."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(91)90036-O","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri, S. Naqvi, O. Schmueli, and S. Tsur. Set constructors in a logic database language. Journal of Logic Programming, 10:181\u2013232, 1991.","journal-title":"Journal of Logic Programming"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"B. B\u00f6rger, E. Gr\u00e4del, and Y. Gurevich. The Classical Decision Problem. Springer Verlag, 1997.","DOI":"10.1007\/978-3-642-59207-2"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In CCC'97, 1997. To appear.","DOI":"10.1109\/CCC.1997.612304"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"E. Dantsin and A. Voronkov. Complexity of query answering in logic databases with complex values. UPMAIL technical report, Uppsala University, Computing Science Department, 1997. http:\/\/www.csd.uu.se\/papers\/reports.html","DOI":"10.1007\/3-540-63045-7_7"},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(95)00147-6","volume":"28","author":"A. Dovier","year":"1996","unstructured":"A. Dovier, E.G. Omodeo, E. Pontelli, and G. Rossi. {log}: A language for programming in logic with finite sets. Journal of Logic Programming, 28(1):1\u201344, 1996.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"7_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1093\/logcom\/5.2.133","volume":"5","author":"M. Gabbrielli","year":"1995","unstructured":"M. Gabbrielli, G.M. Dore, and G. Levi. Observable semantics for constraint logic programs. Journal of Logic and Computation, 5(2):133\u2013171, 1995.","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"7_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(89)90028-9","volume":"6","author":"J.H. Gallier","year":"1989","unstructured":"J.H. Gallier and S. Raatz. Extending SLD-resolution to equational Horn clauses using E-unification. Journal of Logic Programming, 6(3):3\u201344, 1989.","journal-title":"Journal of Logic Programming"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M. Maher. Constraint logic programming: a survey. Journal of Logic Programming, 19,20:503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"7_CR12","volume-title":"Proc. NACLP'89","author":"B. Jayaraman","year":"1989","unstructured":"B. Jayaraman and D.A. Plaisted. Programming with equations, subsets and relations. In Proc. NACLP'89, Cleveland, 1989. MIT Press."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D. Kapur and P. Narendran. NP-completeness of the set unification and matching problems. In J. Siekmann, editor, Proc. 8th CADE, volume 230 of Lecture Notes in Computer Science, 1986.","DOI":"10.1007\/3-540-16780-3_113"},{"key":"7_CR14","doi-asserted-by":"crossref","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 Sciences, 41:44\u201364, 1990.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"7_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/155271.155274","volume":"18","author":"G.M. Kuper","year":"1993","unstructured":"G.M. Kuper and M.Y. Vardi. The logical data model. ACM Transactions on Database Systems, 18(3):379\u2013413, 1993.","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming (2nd edition). Springer Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/BFb0013838","volume":"632","author":"M.J. Maher","year":"1992","unstructured":"M.J. Maher. A CLP view of logic programming. In Proc. Conf. on Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 364\u2013383, October 1992.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"7_CR18","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/131295.131300","volume":"35","author":"T. Munakata","year":"1992","unstructured":"T. Munakata. Notes on implementing sets in Prolog. Communications of the ACM, 35(3):112\u2013120, 1992.","journal-title":"Communications of the ACM"},{"key":"7_CR19","unstructured":"C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"issue":"1","key":"7_CR20","doi-asserted-by":"crossref","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). Journal of Logic Programming, 12(1):89\u2013119, 1992.","journal-title":"Journal of Logic Programming"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"G. Smolka and R. Treinen. Records for logic programming. Journal of Logic Programming, 18:229\u2013258, 1994.","journal-title":"Journal of Logic Programming"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"M. Vardi. The complexity of relational query languages. In Proc. 14th ACM STOC, 1982.","DOI":"10.1145\/800070.802186"},{"key":"7_CR23","unstructured":"A. Voronkov. Logic programming with bounded quantifiers revisited. UPMAIL Technical Report, Uppsala University, Computing Science Department, 1997, to appear."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:19Z","timestamp":1605647719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}