{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:53Z","timestamp":1725485573641},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_2","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T22:48:36Z","timestamp":1180651716000},"page":"19-35","source":"Crossref","is-referenced-by-count":3,"title":["First-Order Logic as a Constraint Programming Language"],"prefix":"10.1007","author":[{"given":"K. R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. F. M.","family":"Vermeulen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"2_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48092-7_5","volume-title":"Correct System Design","author":"R. Apt","year":"1999","unstructured":"R. Apt and A. Schaerf. The Alma project, or how first-order logic can help us in imperative programming. In E.-R. Olderog and B. Steffen, editors, Correct System Design, Lecture Notes in Computer Science 1710, pages 89\u2013113, 1999."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt. A denotational semantics for first-order logic. In Proc. of the computational logic conference (CL2000), Lecture Notes in Artificial Intelligence 1861, pages 53\u201369. Springer Verlag, 2000.","DOI":"10.1007\/3-540-44957-4_4"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"K.R. Apt and M.A. Bezem. Formulas as programs. In K.R. Apt, V.W. Marek, M. Truszcy\u0144ski, and D.S. Warren, editors, The Logic Programming Paradigm: A 25 Year Perspective, pages 75\u2013107, 1999.","DOI":"10.1007\/978-3-642-60085-2_4"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1145\/293677.293679","volume":"20","author":"K.R. Apt","year":"1998","unstructured":"K.R. Apt, J. Brunekreef, V. Partington, and A. Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Toplas, 20(5):1014\u20131066, 1998.","journal-title":"ACM Toplas"},{"issue":"5","key":"2_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/265943.265954","volume":"19","author":"F.S. Boer De","year":"1997","unstructured":"F.S. De Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving concurrent constraint programs correct. In ACM Transactions on Programming Languages and Systems, volume 19(5), pages 685\u2013725, 1997.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR6","first-page":"85","volume-title":"Proc. of International Conference of Fifth Generation Computer Systems (FGCS\u201984)","author":"A. Colmerauer","year":"1984","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In John Lloyd, editor, Proc. of International Conference of Fifth Generation Computer Systems (FGCS\u201984), pages 85\u201399. OHMSHA Ltd. Tokyo and North-Holland, 1984."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(95)00047-Z","volume":"151","author":"F.S. Boer de","year":"1995","unstructured":"F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science, 151(1):37\u201378, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/inco.2000.3002","volume":"165","author":"F. Fages","year":"2001","unstructured":"F. Fages, P. Ruet, and S. Soliman. Linear concurrent constraint programming: Operational and phase semantics. Information and Computation, 165(1):14\u201341, 2001.","journal-title":"Information and Computation"},{"key":"2_CR9","first-page":"20","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and J.M. Maher. Constraint logic programming: a survey. Journal of Logic Programming, 19\/20, 1994.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"J. Jaffar, J.M. Maher, K. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1):1\u201346, 1998.","journal-title":"Journal of Logic Programming"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J.W. Lloyd","year":"1984","unstructured":"J.W. Lloyd and R.W. Topor. Making Prolog more expressive. Journal of Logic Programming, 1:225\u2013240, 1984.","journal-title":"Journal of Logic Programming"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"C. Palamidessi, F.S. de Boer, and A. Di Pierro. An algebraic perspective of constraint logic programming. Journal of Logic and Computation, 7, 1997.","DOI":"10.1093\/logcom\/7.1.1"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 333\u2013352, Orlando, Florida, 1991.","DOI":"10.1145\/99583.99627"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Vijay Saraswat. Concurrent Constraint Programming. MIT Press, 1993.","DOI":"10.7551\/mitpress\/2086.001.0001"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36078-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T12:21:17Z","timestamp":1587558077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}