{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:34:08Z","timestamp":1725561248418},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206422"},{"type":"electronic","value":"9783540245995"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24599-5_30","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:53:55Z","timestamp":1280393635000},"page":"438-450","source":"Crossref","is-referenced-by-count":1,"title":["Is There an Optimal Generic Semantics for First-Order Equations?"],"prefix":"10.1007","author":[{"given":"Jan-Georg","family":"Smaus","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44957-4_4","volume-title":"Computational Logic - CL 2000","author":"K.R. Apt","year":"2000","unstructured":"Apt, K.R.: A denotational semantics for first-order logic. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 53\u201369. Springer, Heidelberg (2000)"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-642-60085-2_4","volume-title":"The Logic Programming Paradigm: A 25 Years Perspective","author":"K.R. Apt","year":"1999","unstructured":"Apt, K.R., Bezem, M.: Formulas as programs. In: Apt, K.R., Marek, V., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25 Years Perspective, pp. 75\u2013107. Springer, Heidelberg (1999)"},{"issue":"5","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1145\/293677.293679","volume":"20","author":"K.R. Apt","year":"1998","unstructured":"Apt, K.R., Brunekreef, J., Schaerf, A., Partington, V.: Alma-0: An imperative language that supports declarative programming. ACM Transactions on Programming Languages and Systems\u00a020(5), 1014\u20131066 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"30_CR4","first-page":"75","volume":"16","author":"K.R. Apt","year":"2001","unstructured":"Apt, K.R., Smaus, J.-G.: Rule-based versus procedure-based view of logic programming. Joint Bulletin of the Novosibirsk Computing Center and Institute of Informatics Systems\u00a016, 75\u201397 (2001)","journal-title":"Joint Bulletin of the Novosibirsk Computing Center and Institute of Informatics Systems"},{"key":"30_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-36078-6_2","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K.R. Apt","year":"2002","unstructured":"Apt, K.R., Vermeulen, C.F.M.: First-order logic as a constraint programming language. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 19\u201335. Springer, Heidelberg (2002)"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/logcom\/7.1.1","volume":"7","author":"F.S. Boer de","year":"1997","unstructured":"de Boer, F.S., Di Pierro, A., Palamidessi, C.: An algebraic perspective of constraint logic programming. Journal of Logic and Computation\u00a07(1), 1\u201338 (1997)","journal-title":"Journal of Logic and Computation"},{"key":"30_CR7","first-page":"293","volume-title":"Advances in Data Base Theory","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Advances in Data Base Theory, pp. 293\u2013322. Plenum Press, New York (1978)"},{"key":"30_CR8","volume-title":"The G\u00f6del Programming Language","author":"P.M. Hill","year":"1994","unstructured":"Hill, P.M., Lloyd, J.W.: The G\u00f6del Programming Language. MIT Press, Cambridge (1994)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming\u00a019\/20, 503\u2013581 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"1-3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"37","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M.J., Marriott, K., Stuckey, P.J.: The semantics of constraint logic programs. Journal of Logic Programming\u00a037(1-3), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"30_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Negation in logic programming. Journal of Logic Programming\u00a04(4), 289\u2013308 (1987)","journal-title":"Journal of Logic Programming"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Proceedings of Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"Lassez, J.-L., Maher, M.J., Marriott, K.: Unification revisited. In: Minker, J. (ed.) Proceedings of Foundations of Deductive Databases and Logic Programming, pp. 587\u2013625. Morgan Kaufmann, San Francisco (1988)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0024177","volume-title":"Programming Language Implementation and Logic Programming","author":"P. Lim","year":"1990","unstructured":"Lim, P., Stuckey, P.J.: A constraint logic programming shell. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) PLILP 1990. LNCS, vol.\u00a0456, pp. 75\u201388. Springer, Heidelberg (1990)"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. Journal of Logic Programming\u00a01(3), 225\u2013240 (1984)","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24599-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:54:30Z","timestamp":1552838070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24599-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206422","9783540245995"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24599-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}