{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:37:12Z","timestamp":1648975032246},"reference-count":22,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1080\/00207160008804975","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:24:38Z","timestamp":1182803078000},"page":"167-186","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic variable ordering in graph based backjumping algorithms for csps"],"prefix":"10.1080","volume":"75","author":[{"given":"D.K.","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"Ph.D. Thesis CS department","author":"Gaschnig J.","year":"1977"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90046-3"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90002-6"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90037-4"},{"key":"CIT0005","first-page":"32","volume":"13","author":"Kumar V.","year":"1992","journal-title":"AI Magazine"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(78)90043-9"},{"key":"CIT0008","first-page":"19","volume-title":"Psychology of Computer Vision","author":"Waltz D.","year":"1975"},{"key":"CIT0009","unstructured":"Zabih, R. A rearrangement search strategy for determining propositional satisfiability. Proceedings of the 7th National Conference on AI (AAAI). pp.155\u2013160."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1976.4309519"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(83)80007-1"},{"key":"CIT0012","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harry F.","year":"1969"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90041-4"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"CIT0015","unstructured":"Zahib, R. and Mcauester, D. A rearrangement search strategy for determining pro-positional satisfiability. Proceedings AAAI-88. MN. St.Paul."},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322292"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361224"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"CIT0019","volume-title":"CSP C Function Library","author":"Beek P.V.","year":"1994"},{"key":"CIT0020","volume-title":"Artificial Intelligence: The Heuristic Programming Approach","author":"Slagle J.R.","year":"1971"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.2307\/2005469"},{"key":"CIT0022","volume-title":"M.Sc.Dissertation","author":"Run P.V.","year":"1994"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160008804975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T15:53:28Z","timestamp":1556553208000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160008804975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1080\/00207160008804975"],"URL":"https:\/\/doi.org\/10.1080\/00207160008804975","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}