{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:04Z","timestamp":1725455644929},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022547","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["The mathematics of set predicates in Prolog"],"prefix":"10.1007","author":[{"given":"Egon","family":"B\u00f6rger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dean","family":"Rosenzweig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"K.R.Apt, Logic Programming, in: J. van Leeuwen (ed.), Formal Models and Semantics. Handbook of Theoretical Computer Science, Vol.B, Elsevier 1990, pp. 493\u2013574","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"1_CR2","unstructured":"H.P.Barendregt, The Lambda Calculus, Elsevier 1984"},{"key":"1_CR3","first-page":"513","volume-title":"A Formal Specification of Prolog by Tree Algebras","author":"E. B\u00f6rger","year":"1991","unstructured":"E.B\u00f6rger, D.Rosenzweig, A Formal Specification of Prolog by Tree Algebras, in: V.\u010ceri\u0107 et.al. (eds.), Proceedings of The Third International Conference on Information Technology Interfaces, SRCE, Zagreb 1991, pp. 513\u2013518"},{"key":"1_CR4","unstructured":"E.B\u00f6rger, D.Rosenzweig, The WAM-Definition and Compiler Correctness, Technical report TR-14\/92, Dipartimento di Informatica, Universit\u00e0 di Pisa 1992"},{"key":"1_CR5","unstructured":"B.Demoen, Code and Comments Regarding bagof\/3, in: PROLOG. Paris papers 2, ISO\/IEC JTC1 SC22 WG17 N.80, pp. 85\u201386"},{"key":"1_CR6","unstructured":"A.Dodd, The Predicates bagof\/3 and setof\/3, a Proposal, in: PRO-LOG. Paris papers 2, ISO\/IEC JTC1 SC22 WG17 N.80, pp. 75\u201384"},{"key":"1_CR7","unstructured":"R.A.O'Keefe, The Craft of Prolog, MIT Press 1990"},{"key":"1_CR8","first-page":"9","volume":"2","author":"L.M. Pereira","year":"1981","unstructured":"L.M.Pereira, A.Porto, All Solutions, in: Logic Programming Newsletter 2, 1981, pp. 9\u201310","journal-title":"Logic Programming Newsletter"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"K.Ueda, Making Exhaustive Search Programs Deterministic, in: Proceedings of the 3rd International Conference on Logic Programming, pp. 270\u2013282","DOI":"10.1007\/3-540-16492-8_81"},{"key":"1_CR10","unstructured":"K.Ueda, Making Exhaustive Search Programs Deterministic, Part 2, in: Proceedings of the 4th International Conference on Logic Programming, pp. 356\u2013375"},{"key":"1_CR11","first-page":"441","volume":"10","author":"D.H.D. Warren","year":"1982","unstructured":"D.H.D.Warren, Higher Order Extensions to Prolog: Are they Needed?, in: Machine Intelligence 10(1982), pp. 441\u2013454","journal-title":"Machine Intelligence"},{"key":"1_CR12","unstructured":"PROLOG. Part 1, General Core, Committee Draft 1.0, ISO\/IEC JTC1 SC22 WG17 N.92"}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022547.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:54Z","timestamp":1607550534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0022547","relation":{},"subject":[]}}