{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:03:46Z","timestamp":1649016226725},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:p> Recently Conery proposed a backward execution algorithm for AND-parallel execution of logic programs, and Ng and Leung extended it. They adopt the same data structure called mark(s) set to store information about failure history during AND-parallel evaluation of clauses. Both of the two algorithms essentially have the same rationale with minor differences and have been considered correct, largely due to their intuitive persuasiveness. We closely re-examine those algorithms and find out that they are incorrect. Their incorrectness comes from oversimplification of failure situations. Our analyses focused on the mark(s)-set-based backtrack literal selection are presented. We also propose another backtrack literal selection method based on the mark(s) set, and prove its correctness. <\/jats:p>","DOI":"10.1142\/s0129626492000192","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"71-79","source":"Crossref","is-referenced-by-count":0,"title":["REFINED MARK(S)-SET-BASED BACKTRACK LITERAL SELECTION FOR AND PARALLELISM IN LOGIC PROGRAMS"],"prefix":"10.1142","volume":"02","author":[{"given":"DO-HYUNG","family":"KIM","sequence":"first","affiliation":[{"name":"Department of Computer Science, Korea Advanced Institute of Science and Technology 373-1, Kusung-Dong, Yusung-Gu, Taejon 305-701, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KWANG-MOO","family":"CHOE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Korea Advanced Institute of Science and Technology 373-1, Kusung-Dong, Yusung-Gu, Taejon 305-701, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAISOOK","family":"HAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Korea Advanced Institute of Science and Technology 373-1, Kusung-Dong, Yusung-Gu, Taejon 305-701, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626492000192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:25:16Z","timestamp":1565108716000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626492000192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1142\/S0129626492000192"],"URL":"https:\/\/doi.org\/10.1142\/s0129626492000192","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}