{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:52Z","timestamp":1725663832702},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554608"},{"type":"electronic","value":"9783540470830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55460-2_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:06:48Z","timestamp":1330232808000},"page":"486-514","source":"Crossref","is-referenced-by-count":9,"title":["Logic programming with bounded quantifiers"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Voronkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"K. Apt and M.van Emden. Contributions to the theory of logic programming. Jornal of the Association for Computing Machinery, 29(3), 1982.","DOI":"10.1145\/322326.322339"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"J.Barwise. Admissible Sets and Structures. Springer Verlag, 1975.","DOI":"10.1007\/978-3-662-11035-5"},{"key":"37_CR3","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.","DOI":"10.1145\/28659.28662"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"H.-J.B\u00fcrkert. A resolution principle for clauses with constraints. In M.E.Stickel, editor, Proc. 10th CADE, volume 449 of Lecture Notes in Artificial Intelligence, pages 178\u2013192, 1990.","DOI":"10.1007\/3-540-52885-7_87"},{"key":"37_CR5","unstructured":"C.C.Chang and H.J.Keisler. Model theory. North Holland, 1977."},{"key":"37_CR6","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":"37_CR7","unstructured":"P.van Hentenryck, V.Saraswat, and Y.Deville. Constraint processing in cc(fd). Technical report, Brown University, December 1991."},{"key":"37_CR8","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":"37_CR9","doi-asserted-by":"crossref","unstructured":"G.M.Kuper. Logic programming with sets. In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 11\u201320. ACM Press, 1987.","DOI":"10.1145\/28659.28661"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"G.M.Kuper. On the expressive power of logic programming languages with sets. In Proc. 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 10\u201314. ACM Press, 1988.","DOI":"10.1145\/308386.308397"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"J.W.Lloyd. Foundations of Logic Programming. Springer Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"37_CR12","unstructured":"S.S.Goncharov and D.I.Sviridenko. \u03a3 -programming (in Russian), volume 120 of Vychislitelnye Systemy, pages 3\u201329. Novosibirsk, 1985."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"S.S.Goncharov and D.I.Sviridenko. Theoretical aspects of \u03c3-programming. In Mathematical Methods of Specification and Synthesis of Software Systems '85, volume 215 of Lecture Notes in Computer Science, pages 169\u2013179, 1986.","DOI":"10.1007\/3-540-16444-8_13"},{"key":"37_CR14","unstructured":"S.S.Goncharov, Yu.L.Ershov, and D.I.Sviridenko. Semantic programming. In IFIP'86, pages 1093\u20131100. Elsevier Science, 1986."},{"issue":"1","key":"37_CR15","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"},{"key":"37_CR16","unstructured":"R.Kowalski. Logic programming. In Proc.IFIP'83, pages 133\u2013145. Elsevier Science, 1983."},{"key":"37_CR17","unstructured":"M.Alexander, P.Bilse, L.Jensen, and e.a. PDC Prolog User's Guide. Prolog Development Center, 1990."},{"key":"37_CR18","unstructured":"T.Sato and H.Tamaki. Transformational logic program synthesis. In Proc. of the Conference on Fifth Generation Computer Systems, pages 195\u2013201. ICOT, 1984."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"J.T.Schwartz, R.B.K.Devar, E.Dubinski, and E.Schonberg. Programming with sets: an Introduction to SETL. Springer Verlag, 1986.","DOI":"10.1007\/978-1-4613-9575-1"},{"key":"37_CR20","unstructured":"Sh.Tsur and C.Zaniolo. LDL: A logic-based language. In Proc. 12th International Conference on Very Large Databases, pages 33\u201340, Kyoto, Japan, 1986."},{"issue":"12","key":"37_CR21","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/15042.15053","volume":"21","author":"D. A. Turner","year":"1986","unstructured":"D.A.Turner. An overview of Miranda. ACM SIGPLAN Notices, 21(12):158\u2013166, 1986.","journal-title":"ACM SIGPLAN Notices"},{"key":"37_CR22","unstructured":"A.Voronkov. Program execution methods in \u03c3-programming (in Russian). In Proc. 4th Soviet Conf. on Applications of Mathematical Logic, pages 51\u201353, Tallinn, 1986."},{"key":"37_CR23","unstructured":"A.Voronkov. Intuitionistic list theory (in Russian). In Proc. 8th Soviet Conf. on Mathematical Logic, page 32, Moscow, 1986."},{"key":"37_CR24","volume-title":"Technical Report 23","author":"A. Voronkov","year":"1986","unstructured":"A.Voronkov. Logic programs and their synthesis (in Russian). Technical Report 23, Institute of Mathematics, Novosibirsk, 1986."},{"key":"37_CR25","volume-title":"Technical Report 24","author":"A. Voronkov","year":"1986","unstructured":"A.Voronkov. Synthesis of logic programs (in Russian). Technical Report 24, Institute of Mathematics, Novosibirsk, 1986."},{"key":"37_CR26","unstructured":"A.Voronkov. A natural calculus for \u03a3-programs (in Russian), volume 120 of Vychislitelnye Systemy, pages 14\u201323. Novosibirsk, 1987."},{"key":"37_CR27","first-page":"67","volume":"1","author":"A. Voronkov","year":"1989","unstructured":"A.Voronkov. Logic programming and \u03a3-programming (in Russian). Kibernetika, (1):67\u201372, 1989.","journal-title":"Kibernetika"},{"key":"37_CR28","volume-title":"Technical Report 71","author":"A. Voronkov","year":"1991","unstructured":"A.Voronkov. N-realizability: one more constructive semantics. Technical Report 71, Monash University, Department of Computer Science, Clayton, Australia, 1991."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55460-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:31:19Z","timestamp":1619559079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55460-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554608","9783540470830"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-55460-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}