{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:40:01Z","timestamp":1749123601697,"version":"3.41.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1023\/a:1006362926464","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T01:36:27Z","timestamp":1040520987000},"page":"483-533","source":"Crossref","is-referenced-by-count":12,"title":["Nonsystematic Search and No-Good Learning"],"prefix":"10.1007","volume":"24","author":[{"given":"E. Thomas","family":"Richards","sequence":"first","affiliation":[]},{"given":"Barry","family":"Richards","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"257229_CR1","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Iwama, K. and E. Miyano: Random generation of test instances with controlled attributes, in Cliques, Colouring and Satisfiability, DIMACS Series in Discrete Math. and Theory Comp. Sci., 1995.","DOI":"10.1090\/dimacs\/026\/18"},{"key":"257229_CR2","unstructured":"Bayardo, R. J. and Miranker, D.: A complexity analysis of space bounded learning algorithms for the constraint satisfaction problem, in Proceedings AAAI-96, 1996."},{"key":"257229_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. and Schrag R.: Using look-back techniques to solve exceptionally hard SAT instances, in Proceedings CP-96, Cambridge, MA, August, 1996.","DOI":"10.1007\/3-540-61551-2_65"},{"key":"257229_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. and Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances, in Proceedings AAAI-97, Providence, RI, July, 1997.","DOI":"10.1007\/3-540-61551-2_65"},{"key":"257229_CR5","unstructured":"Cha, B. and Iwama, K.: Performance test of local search algorithms using new types of random CNF formulas, in Proceedings IJCAI-95, 1995."},{"key":"257229_CR6","unstructured":"Cha, B. and Iwama, K.: Adding new clauses for faster local search, in Proceedings AAAI-96, 1996."},{"key":"257229_CR7","unstructured":"Cheeseman, P., Kanefsky, B. and Taylor, W.: Where the really hard problems are, in Proceedings IJCAI-91, 1991."},{"key":"257229_CR8","doi-asserted-by":"crossref","unstructured":"Crawford, J.M. and Auton, L. D.: Experimental results on the crossover point in random 3SAT, Artif. Intell.\n81 (1996).","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"257229_CR9","unstructured":"Crawford, J. M. and Baker, A. B.: Experimental results on the application of satisfiability algorithms to scheduling problems, in Proceedings AAAI-93, 1993."},{"key":"257229_CR10","doi-asserted-by":"crossref","unstructured":"Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM (1960).","DOI":"10.1145\/321033.321034"},{"key":"257229_CR11","doi-asserted-by":"crossref","unstructured":"Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition, Artif. Intell.\n41 (1990).","DOI":"10.1016\/0004-3702(90)90046-3"},{"key":"257229_CR12","unstructured":"Dubois, O. and Boufkhad, Y.: From very hard doubly balanced SAT formulae to easy unbalanced SAT forumlae, variations of the satisfiability threshold, in Proceedings of the DIMACS Workshop on the Satisfiability Problem: Theory and Applications, 1996."},{"key":"257229_CR13","unstructured":"Frost, D. and Dechter, R.: Dead-end driven learning, in Proceedings AAAI-94, 1994."},{"key":"257229_CR14","doi-asserted-by":"crossref","unstructured":"Ginsberg, M.: Dynamic backtracking, J. Artif. Intell. Res. (1993).","DOI":"10.1613\/jair.1"},{"key":"257229_CR15","doi-asserted-by":"crossref","unstructured":"Ginsberg, M. and McAllester, D.: GSAT and dynamic backtracking, in Principles of Knowledge Representation and Reasoning 4th International Conference, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50117-2"},{"key":"257229_CR16","doi-asserted-by":"crossref","unstructured":"Golomb, S. and Baumert, L.: Backtrack programming, J. ACM (1965).","DOI":"10.1145\/321296.321300"},{"key":"257229_CR17","doi-asserted-by":"crossref","unstructured":"Haralick, R. and Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems, Artif. Intell. (1980).","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"257229_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Richards, E. T. and Richards, B.: No-good backmarking with min-conflict repair in constraint satisfaction and optimisation, in Proceedings PPCP-94 2nd International Workshop, WA, 1994.","DOI":"10.1007\/3-540-58601-6_87"},{"key":"257229_CR19","unstructured":"Kondrak, G. and van Beek, P.: A theoretical evaluation of selected backtracking algorithms, in Proceedings IJCAI-95, 1995."},{"key":"257229_CR20","doi-asserted-by":"crossref","unstructured":"Langley, P.: Systematic and non-systematic search strategies, in Artificial Intelligence and Planning Systems: Proceedings of 1st International Conference, 1992.","DOI":"10.1016\/B978-0-08-049944-4.50022-7"},{"key":"257229_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.370","volume":"6","author":"D. L. Mammen","year":"1997","unstructured":"Mammen, D. L. and Hogg, T.: A new look at the easy-hard-easy pattern of combinatorial search difficulty, J. Artif. Intell. Res.\n6 (1997), 47\u201366.","journal-title":"J. Artif. Intell. Res."},{"key":"257229_CR22","unstructured":"Maruyama, F., Minoda, Y., Sawada, S., Takizawa, Y. and Kawato, N.: Solving combinatorial constraint satisfaction and optimization problems using sufficient conditions for constraint violation, in Proceedings ISAI-91 4th International Symposium on AI, 1991."},{"key":"257229_CR23","doi-asserted-by":"crossref","unstructured":"Minton, S., Johnston, M. D., Phillips, A. B. and Laird, P.: Minimising conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell.\n58 (1992).","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"257229_CR24","unstructured":"Mitchell, D., Selman, B. and Levesque, H.: Hard and easy distributions of SAT problems, in Proceedings AAAI-92, 1992."},{"key":"257229_CR25","unstructured":"Morris, P.: The breakout method for escaping local minima, in Proceedings AAAI-93, 1993."},{"key":"257229_CR26","doi-asserted-by":"crossref","unstructured":"Nadel, B.: Constraint satisfaction algorithms, Computational Intelligence, 1989.","DOI":"10.1111\/j.1467-8640.1989.tb00328.x"},{"key":"257229_CR27","volume-title":"Combinatorial Optimisation: Algorithms and Complexity","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. and Steiglitz, K.: Combinatorial Optimisation: Algorithms and Complexity, Prentice-Hall Inc., Englewood Cliffs, NJ, 1982."},{"key":"257229_CR28","doi-asserted-by":"crossref","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem, Comput. Intelligence\n9 (1993).","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"257229_CR29","unstructured":"Richards, E. T.: Non-systematic search and no-good learning, Ph.D. Thesis, IC Parc, Imperial College, 1998."},{"key":"257229_CR30","unstructured":"Richards, E. T., Jiang, Y. and Richards, B.: Ng-backmarking-an algorithm for constraint satisfaction, AIP Techniques for Resource Scheduling and Planning, BT Technology J.\n13(1) (1995)."},{"key":"257229_CR31","unstructured":"Richards, E. T. and Richards, B.: No-good learning for constraint satisfaction, in Proceedings CP-96 Workshop on Constraint Programming Applications, 1996."},{"key":"257229_CR32","unstructured":"Richards, E. T. and Richards, B.: Restart-repair and learning: An empirical study of single solution 3-SAT problems, in Proceedings CP-97 Workshop on the Theory and Practice of Dynamic Constraint Satisfaction, 1997."},{"key":"257229_CR33","doi-asserted-by":"crossref","unstructured":"Richards, E. T. and Richards, B.: Non-systematic search and learning: An empirical study, in Principles and Practice of Constraint Satisfaction CP-98, 1998.","DOI":"10.1007\/3-540-49481-2_27"},{"key":"257229_CR34","unstructured":"Schiex, T. and Verfaillie, G.: No-good recording for static and dynamic constraint satisfaction problems, in Proceedings IEEE 5th International Conference on Tools with Artificial Intelligence, 1993."},{"key":"257229_CR35","unstructured":"Schiex, T. and Verfaillie, G.: Stubbornness: A possible enhancement for backjumping and no-good recording, in Proceedings ECAI-94, 1994."},{"key":"257229_CR36","unstructured":"Selman, B., Levesque, H. J. and Mitchell, D. G.: A new method for solving hard satisfiability problems, in Proceedings AAAI-92, 1992."},{"key":"257229_CR37","unstructured":"Selman, B. and Kautz, H.: An empirical study of greedy local search for satisfiability testing, in Proceedings AAAI-93, 1993."},{"key":"257229_CR38","unstructured":"Selman, B. and Kautz, H.: Local search strategies for satisfiability testing, in Proceedings 2nd DIMACS Challenge Workshop, 1993."},{"key":"257229_CR39","unstructured":"Siegel, P.: Representation et utilisation des connaissances en calcul propositionnel, These d'Etat, Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille II, 1987."},{"key":"257229_CR40","unstructured":"Smith, B.: How to solve the Zebra problem, or path consistency the easy way, in Proceedings of ECAI-92, Austria, 1992."},{"key":"257229_CR41","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction, Academic Press, 1993."},{"key":"257229_CR42","unstructured":"Verfaillie, G. and Schiex, T.: Dynamic dacktracking for dynamic constraint satisfaction problems, in Proceedings ECAI-94, 1994."},{"key":"257229_CR43","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. van Hentenryck","year":"1989","unstructured":"van Hentenryck, P.: Constraint Satisfaction in Logic Programming, MIT Press, London, 1989."},{"key":"257229_CR44","doi-asserted-by":"crossref","unstructured":"Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems, in Proceedings AAAI-94, 1994.","DOI":"10.1007\/3-540-60299-2_6"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006362926464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006362926464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006362926464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:26:47Z","timestamp":1749122807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006362926464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["257229"],"URL":"https:\/\/doi.org\/10.1023\/a:1006362926464","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}