{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:09:57Z","timestamp":1648987797625},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0020-0190(89)90121-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"185-189","source":"Crossref","is-referenced-by-count":1,"title":["An improved data-dependency-based backtracking scheme for prolog"],"prefix":"10.1016","volume":"31","author":[{"given":"Vishv Mohan","family":"Malhotra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tang Van","family":"To","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanchana","family":"Kanchanasut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90121-X_BIB1","series-title":"Implementation of Prolog","first-page":"194","article-title":"Deduction revision by intelligent backtracking","author":"Bruynooghe","year":"1984"},{"key":"10.1016\/0020-0190(89)90121-X_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF03037439","article-title":"Maximal unifiable subsets and minimal non-unifiable subsets","volume":"4","author":"Chen","year":"1986","journal-title":"New Generation Computing"},{"key":"10.1016\/0020-0190(89)90121-X_BIB3","series-title":"Logic Programming: Proc. 5th Internat. Conf. and Symp.","first-page":"247","article-title":"Yet another intelligent backtracking method","author":"Codognet","year":"1988"},{"key":"10.1016\/0020-0190(89)90121-X_BIB4","series-title":"Implementation of Prolog","first-page":"216","article-title":"Finding backtracking points for intelligent backtracking","author":"Cox","year":"1984"},{"key":"10.1016\/0020-0190(89)90121-X_BIB5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0743-1066(88)90017-9","article-title":"A data-dependency-based intelligent backtracking scheme for Prolog","volume":"5","author":"Kumar","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(89)90121-X_BIB6","series-title":"Ms. Engg. Thesis","article-title":"A History-based Backtracking Scheme for Prolog","author":"To","year":"1988"},{"key":"10.1016\/0020-0190(89)90121-X_BIB7","series-title":"Tech. Note 309","article-title":"An Abstract Prolog Instruction Set","author":"Warren","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908990121X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908990121X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:20Z","timestamp":1555073780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908990121X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["002001908990121X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90121-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}