{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:46Z","timestamp":1725664726118},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609834"},{"type":"electronic","value":"9783540497516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60983-0_1","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:09:51Z","timestamp":1330290591000},"page":"1-18","source":"Crossref","is-referenced-by-count":1,"title":["Semantics of constraint logic programs with bounded quantifiers"],"prefix":"10.1007","author":[{"given":"Martin","family":"Argenius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"1_CR1","series-title":"number 379 in Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-51486-4_62","volume-title":"Mathematical Foundations of Computer Science","author":"J.H. Andrews","year":"1989","unstructured":"J.H. Andrews. Proof-theoretic characterizations of logic programming. In Mathematical Foundations of Computer Science, number 379 in Lecture Notes in Computer Science, pages 145\u2013154, Porabka-Kozubnik, Poland, 1989."},{"doi-asserted-by":"crossref","unstructured":"M. Argenius and A. Voronkov. Semantics of constraint logic programs with bounded quantifiers. UPMAIL Technical Report 115, Uppsala University, Computing Science Department, September 1995. Available at http:\/\/www.csd.uu.se\/\u223cthomasl\/reports.html and by anonymous ftp at ftp. csd. uu. se in directory pub\/papers\/reports.","key":"1_CR2","DOI":"10.1007\/3-540-60983-0_1"},{"unstructured":"J. Barklund and P.M. Hill. Extending G\u00f6del for expressing restricted quantification and arrays. UPMAIL Technical Report 102, Uppsala University, Computing Science Department, March 1995.","key":"1_CR3"},{"key":"1_CR4","first-page":"817","volume-title":"Proc. of the International Conference on Fifth Generation Computer Systems","author":"J. Barklund","year":"1992","unstructured":"J. Barklund and H. Millroth. Providing iteration and concurrency in logic programs through bounded quantifications. In Proc. of the International Conference on Fifth Generation Computer Systems, pages 817\u2013824, Tokyo, 1992. ICOT."},{"doi-asserted-by":"crossref","unstructured":"C. Beeri, Sh. Naqvi, R. Ramakrishnan, O. Shmueli, and Sh. Tsur. Sets and negation in a logic database language (LDL1). In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 21\u201336. ACM Press, 1987.","key":"1_CR5","DOI":"10.1145\/28659.28662"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Base","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Base, pages 293\u2013322. Plenum Press, New York, 1978."},{"unstructured":"A. Dovier, E.G. Omodeo, E. Pontelli, and G. Rossi. {log}: A logic programming language with finite sets. In Proc. ICLP'91, pages 109\u2013124. MIT Press, 1991.","key":"1_CR7"},{"issue":"2","key":"1_CR8","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"},{"unstructured":"S.S. Goncharov, Yu.L. Ershov, and D.I. Sviridenko. Semantic programming. In IFIP'86, pages 1093\u20131100. Elsevier Science, 1986.","key":"1_CR9"},{"key":"1_CR10","first-page":"3","volume":"120","author":"S.S. Goncharov","year":"1985","unstructured":"S.S. Goncharov and D.I. Sviridenko. \u03a3-programming (in Russian). volume 120 of Vychislitelnye Systemy, pages 3\u201329. Novosibirsk, 1985.","journal-title":"Vychislitelnye Systemy"},{"doi-asserted-by":"crossref","unstructured":"S.S. Goncharov and D.I. Sviridenko. Theoretical aspects of \u03a3-programming. In Mathematical Methods of Specification and Synthesis of Software Systems'85, volume 215 of Lecture Notes in Computer Science, pages 169\u2013179, 1986.","key":"1_CR11","DOI":"10.1007\/3-540-16444-8_13"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF03037052","volume":"2","author":"M. Hagiya","year":"1984","unstructured":"M. Hagiya and T. Sakurai. Foundation of logic programming based on inductive definition. New Generation Computing, 2(1):59\u201377, 1984.","journal-title":"New Generation Computing"},{"doi-asserted-by":"crossref","unstructured":"L. Halln\u00e4s and P. Schroeder-Heister. A proof-theoretic approach to logic programming i. clauses as rules. Journal of Logic and Computation, 1(2), 1990.","key":"1_CR13","DOI":"10.1093\/logcom\/1.2.261"},{"issue":"20","key":"1_CR14","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"},{"doi-asserted-by":"crossref","unstructured":"G.M. Kuper. Logic programming with sets. In Proc. 6th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems, pages 11\u201320. ACM Press, 1987.","key":"1_CR15","DOI":"10.1145\/28659.28661"},{"key":"1_CR16","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"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck Van","year":"1992","unstructured":"P. Van Hentenryck, H. Simonis, and M. Dincbas. Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58:113\u2013159, 1992.","journal-title":"Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"A. Voronkov. Logic programming with bounded quantifiers. In A. Voronkov, editor, Logic Programming, volume 592 of Lecture Notes in Artificial Intelligence, pages 486\u2013514. Springer Verlag, 1992.","key":"1_CR18","DOI":"10.1007\/3-540-55460-2_37"},{"unstructured":"A. Voronkov. Logic programming with bounded quantifiers revisited. UPMAIL Technical Report 114, Uppsala University, Computing Science Department, September 1995.","key":"1_CR19"}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60983-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:19Z","timestamp":1605646999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60983-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609834","9783540497516"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60983-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}