{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:39:28Z","timestamp":1793126368800,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602996","type":"print"},{"value":"9783540447887","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:27Z","timestamp":1330280067000},"page":"292-309","source":"Crossref","is-referenced-by-count":14,"title":["On the forward checking algorithm"],"prefix":"10.1007","author":[{"given":"Fahiem","family":"Bacchus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Grove","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"11","key":"18_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J. R. Bitner","year":"1975","unstructured":"J. R. Bitner and Reingold E. Backtracking programming techniques. Communications of the ACM, 18(11):651\u2013656, 1975.","journal-title":"Communications of the ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Fahiem Bacchus and Paul van Run. Dynamic variable reordering in CSPs. In First International Conference on Principles and Practice of Constraint Programming (CP95), 1995.","DOI":"10.1007\/3-540-60299-2_16"},{"key":"18_CR3","unstructured":"Peter Cheeseman, Bob Kanefsky, and Willian M. Taylor. Where the really hard problems are. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pages 331\u2013337, 1991."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"M. J. Dent and R. E. Mercer. Minimal forward checking. In 6th IEEE International Conference on Tools with Artificial Intelligence, pages 432\u2013438, New Orleans, 1994. Available via anonymous ftp from ftp:\/\/csd.uwo.ca\/pub\/csd-technical-reports\/374\/tai94.ps.z.","DOI":"10.1109\/TAI.1994.346460"},{"key":"18_CR5","unstructured":"Daniel Frost and Rina Dechter. In search of the best constraint satisfaction search. In Proceedings of the AAAI National Conference, pages 301\u2013306, 1994."},{"key":"18_CR6","unstructured":"J. Gaschnig. A general Backtracking algorithm that eliminates most redundant tests. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), page 457, 1977."},{"key":"18_CR7","unstructured":"J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Canadian Artifical Intelligence Conference, pages 268\u2013277, 1978."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"key":"18_CR9","unstructured":"Grzegorz Kondrak and Peter van Beek. A theoretical evaluation of selected backtracking algorithms. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), 1995."},{"key":"18_CR10","volume-title":"Encyclopedia of Artificial Intelligence","author":"A. K. Mackworth","year":"1987","unstructured":"A. K. Mackworth. Constraint satisfaction. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence. John Wiley and Sons, New York, 1987."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B. A. Nadel","year":"1989","unstructured":"Bernard A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5:188\u2013224, 1989.","journal-title":"Computational Intelligence"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3), 1993.","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"18_CR13","series-title":"LNCS 923","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-59479-5_26","volume-title":"Constraint Processing","author":"P. Prosser","year":"1995","unstructured":"P. Prosser. Forward checking with backmarking. In M. Meyer, editor, Constraint Processing, LNCS 923, pages 185\u2013204. Springer-Verlag, New York, 1995."},{"key":"18_CR14","volume-title":"Master's thesis","author":"P. Run van","year":"1994","unstructured":"Paul van Run. Domain independant heuristics in hybrid algorithms for CSPs. Master's thesis, Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1994. Available via anonymous ftp at \u201clogos.uwaterloo.ca\u201d in the file \u201c\/pub\/bacchus\/vanrun.ps.z\u201d."},{"key":"18_CR15","unstructured":"Monte Zweben and Megan Eskey. Constraint satisfaction with delayed evaluation. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pages 875\u2013880, 1989."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:59:36Z","timestamp":1742597976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}