{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:44:20Z","timestamp":1648799060042},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[1999,2]]},"abstract":"<jats:p> The backtracking algorithm is a prominent search technique in AI, particularly due to its use in Constraint Satisfaction Problems (CSPs), Truth Maintenance Systems (TMS), and PROLOG. In the context of CSPs, Dechter<jats:sup>5<\/jats:sup> and Gashnig<jats:sup>10<\/jats:sup> proposed two variants of the backtracking algorithm known as backjumping algorithms. One is graph-based and the other is failure-based backjumping algorithm. These algorithms attempt to backjump to the source of failure in case of a dead-end situation. This improves the backtracking performance. However, these algorithms are not consistent in the selection of the variable to backjump. <\/jats:p><jats:p> In this paper, the modifications of both types of backjumping algorithms are proposed. These algorithms adopt a technique to select the variable to backjump in a consistent manner. This further increases the search efficiency in them. The merits of these modified algorithms are investigated theoretically. Experimental results on the zebra problem and random problems show that the modified algorithms give better results on most occasions. <\/jats:p>","DOI":"10.1142\/s0218001499000082","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:59:35Z","timestamp":1051135175000},"page":"133-147","source":"Crossref","is-referenced-by-count":0,"title":["MODIFIED BACKJUMPING ALGORITHMS FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS"],"prefix":"10.1142","volume":"13","author":[{"given":"U.","family":"CHOWDHURY","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. K.","family":"GUPTA","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90074-0"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02221492"},{"key":"p_6","first-page":"4","volume":"3","author":"R","year":"1988","journal-title":"Artif. Intell."},{"key":"p_7","first-page":"325","volume":"1991","author":"Van Hentenryck Y","journal-title":"Proc. 12th Int. Joint"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(79)90008-0"},{"key":"p_10","first-page":"9","volume":"2","author":"Freuder E","journal-title":"J. ACM"},{"key":"p_12","first-page":"4","volume":"1","author":"Elliot H","year":"1980","journal-title":"Artif. Intell."},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1989.tb00328.x"},{"key":"p_15","first-page":"8","volume":"2","author":"Henderson R.","year":"1986","journal-title":"Artif. Intell."},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90029-7"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001499000082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:11:14Z","timestamp":1565129474000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001499000082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1999,2]]}},"alternative-id":["10.1142\/S0218001499000082"],"URL":"https:\/\/doi.org\/10.1142\/s0218001499000082","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}