Dynamic Backtracking Export

@misc{citeulike:612641, abstract = {The goal of this project was to turn the intuitions behind dynamic backtracking into a series of formally verified algorithms, implement the algorithms, and test the results on realistic problems. These goals have been met and exceeded. Dynamic backtracking has been generalized to partial-order dynamic backtracking, and has been formalized, tested on academic benchmarks, and applied (by one of CIRL's industrial partners) to real industrial scheduling problems. Equally importantly, the search...}, author = {Ginsberg, Matthew L. and Crawford, James M. and Etherington, David W.}, citeulike-article-id = {612641}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.3725}, keywords = {constraint, csc5240, searching, unavailable}, posted-at = {2006-05-03 19:40:05}, priority = {3}, title = {Dynamic Backtracking}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.3725}, year = {1996} }

TY - GEN ID - citeulike:612641 L3 - citeulike-article-id:612641 N2 - The goal of this project was to turn the intuitions behind dynamic backtracking into a series of formally verified algorithms, implement the algorithms, and test the results on realistic problems. These goals have been met and exceeded. Dynamic backtracking has been generalized to partial-order dynamic backtracking, and has been formalized, tested on academic benchmarks, and applied (by one of CIRL's industrial partners) to real industrial scheduling problems. Equally importantly, the search... TI - Dynamic Backtracking KW - constraint KW - csc5240 KW - searching KW - unavailable AU - Ginsberg, Matthew AU - Crawford, James AU - Etherington, David PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.3725 ER -