{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:09:37Z","timestamp":1648757377809},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7870,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0743-1066(92)90043-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"179-188","source":"Crossref","is-referenced-by-count":0,"title":["The expressive power of side effects in prolog"],"prefix":"10.1016","volume":"12","author":[{"given":"J.A.","family":"Makowsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-C.","family":"Gr\u00e9goire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90043-3_BIB1","series-title":"Quintus Prolog Reference Manual","author":"Bowen","year":"1985"},{"key":"10.1016\/0743-1066(92)90043-3_BIB2","series-title":"Technical Report IWBS 111","article-title":"A Logical Operational Semantics for Full Prolog","author":"Boerger","year":"1990"},{"key":"10.1016\/0743-1066(92)90043-3_BIB3","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0743-1066(92)90043-3_BIB4","series-title":"Sets Definable by Finite Automata","author":"Cobham","year":"1964"},{"key":"10.1016\/0743-1066(92)90043-3_BIB5","series-title":"LNCS 385, 2nd Workshop on Computer Science Logic","first-page":"148","article-title":"Loop Detection in Propositional PROLOG","author":"Kleine-B\u00fcnning","year":"1988"},{"key":"10.1016\/0743-1066(92)90043-3_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0743-1066(92)90043-3_BIB7","series-title":"The Art of Prolog","author":"Sterling","year":"1986"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900433?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106692900433?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:37Z","timestamp":1555127797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106692900433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0743106692900433"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90043-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}