{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:49Z","timestamp":1749124069882,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_27","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"370-384","source":"Crossref","is-referenced-by-count":10,"title":["Non-systematic Search and Learning: An empirical study"],"prefix":"10.1007","author":[{"given":"E. Thomas","family":"Richards","sequence":"first","affiliation":[]},{"given":"Barry","family":"Richards","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Y. Asahiro, K. Iwama and E. Miyano, Random generation of test instances with controlled attributes, Cliques, Colouring and Satisfiability. DIMACS Series in Disc. Math. and Theory Comp. Sci., 1995","DOI":"10.1090\/dimacs\/026\/18"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo and R. Schrag, Using CSP look-back techniques to solve exceptionally hard SAT instances. Proceedings CP96, Cambridge, MA, USA, August 1996","DOI":"10.1007\/3-540-61551-2_65"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo and R. Schrag, Using CSP look-back techniques to solve real-world SAT instances. Proceedings AAAI-97, Providence, RI, USA, July 1997","DOI":"10.1007\/3-540-61551-2_65"},{"key":"27_CR4","unstructured":"B. Cha and K. Iwama, Performance test of local search algorithms using new types of random CNF formulas. Proceedings IJCAI-95, 1995"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"J.M. Crawford and L.D, Auton, Experimental results on the crossover point in random 3SAT. Artificial Intelligence 81, 1996.","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"R. Dechter, Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition. Artificial Intelligence 41, 1990","DOI":"10.1016\/0004-3702(90)90046-3"},{"key":"27_CR7","unstructured":"D. Frost and R. Dechter, Dead-end driven learning, Proceedings AAAI-94, 1994"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. Ginsberg","year":"1993","unstructured":"M. Ginsberg, Dynamic Backtracking. Journal of Artificial Intelligence Research, 1:25\u201346, 1993","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Y. Jiang, E. T. Richards, and B. Richards, No-good backmarking with min-conflict repair in constraint satisfaction and optimisation. Proceedings PPCP-94 2nd International Workshop, Washington State USA, 1994","DOI":"10.1007\/3-540-58601-6_87"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.370","volume":"6","author":"D. L. Mammen","year":"1997","unstructured":"D. L. Mammen and T. Hogg, A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty. Journal of Artificial Intelligence Research, 6:47\u201366, 1997","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR11","unstructured":"F. Maruyama, Y. Minoda, S. Sawada, Y. Takizawa, and N, Kawato, Solving Combinatorial Constraint Satisfaction and Optimization Problems Using Sufficient Conditions for Constraint Violation. ISAI-91 4th International Symposium on AI, 1991"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"S. Minton, M. D. Johnston, A. B. Phillips and P. Laird, Minimising conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58, 1992","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"P. Prosser, Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9, 1993","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"27_CR14","unstructured":"E. T. Richards, Y. Jiang and B. Richards, Ng-backmarking-an algorithm for constraint satisfaction. AIP Techniques for Resource Scheduling and Planning, BT Technology Journal Vol. 13 No 1 January, 1995"},{"key":"27_CR15","unstructured":"E. T. Richards and B. Richards, No-good Learning for Constraint Satisfaction. Proceedings CP-96 Workshop on Constraint Programming Applications, 1996"},{"key":"27_CR16","unstructured":"E. T. Richards and B. Richards, Restart-Repair and Learning: An empirical study of single solution 3-SAT problems. Proceedings CP-97 Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, 1997"},{"key":"27_CR17","unstructured":"T. Schiex and G. Verfaillie, No-good Recording for Static and Dynamic Constraint Satisfaction Problems. Proceedings IEEE 5th International Conference on Tools with Artificial Intelligence, 1993"},{"key":"27_CR18","unstructured":"T. Schiex and G. Verfaillie, Stubbornness: a possible enhancement for backjumping and no-good recording. Proceedings ECAI-94, 1994"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"M. Yokoo, Weak-commitment search for solving constraint satisfaction problems. Proceedings AAAI-94, 1994","DOI":"10.1007\/3-540-60299-2_6"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T21:24:28Z","timestamp":1737581068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}