{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T20:53:01Z","timestamp":1672433581646},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5-6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1017\/s1471068404002042","type":"journal-article","created":{"date-parts":[[2004,10,14]],"date-time":"2004-10-14T08:31:43Z","timestamp":1097742703000},"page":"719-751","source":"Crossref","is-referenced-by-count":7,"title":["Inference of termination conditions for numerical loops in Prolog"],"prefix":"10.1017","volume":"4","author":[{"given":"ALEXANDER","family":"SEREBRENIK","sequence":"first","affiliation":[]},{"given":"DANNY","family":"DE SCHREYE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2004,8,12]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068404002042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T17:40:11Z","timestamp":1492796411000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.journals.cambridge.org\/abstract_S1471068404002042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,12]]},"references-count":0,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S1471068404002042"],"URL":"https:\/\/doi.org\/10.1017\/s1471068404002042","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,12]]}}}