{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:56Z","timestamp":1725558416172},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_43","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"530-543","source":"Crossref","is-referenced-by-count":0,"title":["More Computation Power for a Denotational Semantics for First Order Logic"],"prefix":"10.1007","author":[{"given":"Kess F. M.","family":"Vermeulen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_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":"43_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Bol, R.: Logic programming and negation: a survey. Journal of Logic Programming, 9\u201371 (1994)","DOI":"10.1016\/0743-1066(94)90024-8"},{"issue":"5","key":"43_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., Partington, V., Schaerf, A.: Alma-0: An imperative language that supports declarative programming. ACM Toplas\u00a020(5), 1014\u20131066 (1998)","journal-title":"ACM Toplas"},{"key":"43_CR4","unstructured":"Apt, K.R., Smaus, J.-G.: Rule-based versus procedure-based view on programming. In: Joint Bulletin of the Novosibirsk Computing Center and Institute of Informatics Systems. Computer Science, vol.\u00a016, pp. 75\u201397 (2001)"},{"key":"43_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 viewed as a constraint programming language. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 19\u201335. Springer, Heidelberg (2002)"},{"key":"43_CR6","first-page":"20","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, J.M.: Constraint logic programming: a survey. Journal of Logic Programming 19\/20 (1994)","journal-title":"Journal of Logic Programming"},{"key":"43_CR7","first-page":"569","volume-title":"Proc. of the IFIP Congress 1974","author":"R. Kowalski","year":"1974","unstructured":"Kowalski, R.: Predicate logic as a programming language. In: Proc. of the IFIP Congress 1974, pp. 569\u2013574. North-Holland, Amsterdam (1974)"},{"key":"43_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"43_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: an introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.: Programming with Constraints: an introduction. The MIT Press, Cambridge (1998)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Smaus, J.-G.: The optimality of apt\u2019s generic semantics for first-order equations (2002) (work in progress)","DOI":"10.1007\/978-3-540-24599-5_30"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:01:39Z","timestamp":1559221299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}