Nonsystematic search and no-good learning

Journal of Automated Reasoning

Volumn 24, Issue 4, 2000, Pages 483-533

  Richards, E Thomas ^a   Richards, Barry ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LEARNING ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION PROBLEMS; NONSYSTEMATIC SEARCH ALGORITHMS; RANDOM GENERATOR; SATISFIABILITY OF PROPORTIONAL FORMULA;

LEARNING SYSTEMS;

EID: 0033692185     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006362926464     Document Type: Article

References (44)

1. 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.
2. Bayardo, R. J. and Miranker, D.: A complexity analysis of space bounded learning algorithms for the constraint satisfaction problem, in Proceedings AAAI-96, 1996.
3. Bayardo, R. J. and Schrag R.: Using look-back techniques to solve exceptionally hard SAT instances, in Proceedings CP-96, Cambridge, MA, August, 1996.
4. 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.
5. Cha, B. and Iwama, K.: Performance test of local search algorithms using new types of random CNF formulas, in Proceedings IJCAI-95, 1995.
6. Cha, B. and Iwama, K.: Adding new clauses for faster local search, in Proceedings AAAI-96, 1996.
7. Cheeseman, P., Kanefsky, B. and Taylor, W.: Where the really hard problems are, in Proceedings IJCAI-91, 1991.
8. Crawford, J. M. and Auton, L. D.: Experimental results on the crossover point in random 3SAT, Artif. Intell. 81 (1996).
9. Crawford, J. M. and Baker, A. B.: Experimental results on the application of satisfiability algorithms to scheduling problems, in Proceedings AAAI-93, 1993.
10. Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM (1960).
11. Dechter, R.: Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition, Artif. Intell. 41 (1990).
12. 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.
13. Frost, D. and Dechter, R.: Dead-end driven learning, in Proceedings AAAI-94, 1994.
14. Ginsberg, M.: Dynamic backtracking, J. Artif. Intell. Res. (1993).
15. Ginsberg, M. and McAllester, D.: GSAT and dynamic backtracking, in Principles of Knowledge Representation and Reasoning 4th International Conference, 1994.
16. Golomb, S. and Baumert, L.: Backtrack programming, J. ACM (1965).
17. Haralick, R. and Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems, Artif. intell. (1980).
18. 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.
19. Kondrak, G. and van Beek, P.: A theoretical evaluation of selected backtracking algorithms, in Proceedings IJCAI-95, 1995.
20. Langley, P.: Systematic and non-systematic search strategies, in Artificial Intelligence and Planning Systems: Proceedings of 1st International Conference, 1992.
21. Mammen, D. L. and Hogg, T.: A new look at the easy-hard-easy pattern of combinatorial search difficulty, J. Artif. Intell. Res. 6 (1997), 47-66.
22. 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.
23. 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. 58 (1992).
24. Mitchell, D., Selman, B. and Levesque, H.: Hard and easy distributions of SAT problems, in Proceedings AAAI-92, 1992.
25. Morris, P.: The breakout method for escaping local minima, in Proceedings AAAI-93, 1993.
26. Nadel, B.: Constraint satisfaction algorithms, Computational Intelligence, 1989.
27. Papadimitriou, C. and Steiglitz, K.: Combinatorial Optimisation: Algorithms and Complexity, Prentice-Hall Inc., Englewood Cliffs, NJ, 1982.
28. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem, Comput. Intelligence 9 (1993).
29. Richards, E. T.: Non-systematic search and no-good learning, Ph.D. Thesis, IC Parc, Imperial College, 1998.
30. 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. 13(1) (1995).
31. Richards, E. T. and Richards, B.: No-good learning for constraint satisfaction, in Proceedings CP-96 Workshop on Constraint Programming Applications, 1996.
32. 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.
33. Richards, E. T. and Richards, B.: Non-systematic search and learning: An empirical study, in Principles and Practice of Constraint Satisfaction CP-98, 1998.
34. 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.
35. Schiex, T. and Verfaillie, G.: Stubbornness: A possible enhancement for backjumping and no-good recording, in Proceedings ECAI-94, 1994.
36. Selman, B., Levesque, H. J. and Mitchell, D. G.: A new method for solving hard satisfiability problems, in Proceedings AAAI-92, 1992.
37. Selman, B. and Kautz, H.: An empirical study of greedy local search for satisfiability testing, in Proceedings AAAI-93, 1993.
38. Selman, B. and Kautz, H.: Local search strategies for satisfiability testing, in Proceedings 2nd DIMACS Challenge Workshop, 1993.
39. Siegel, P.: Representation et utilisation des connaissances en calcul propositionnel, These d'Etat, Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille II, 1987.
40. Smith, B.: How to solve the Zebra problem, or path consistency the easy way, in Proceedings of ECAI-92, Austria, 1992.
41. Tsang, E.: Foundations of Constraint Satisfaction, Academic Press, 1993.
42. Verfaillie, G. and Schiex, T.: Dynamic dacktracking for dynamic constraint satisfaction problems, in Proceedings ECAI-94, 1994.
43. van Hentenryck, P.: Constraint Satisfaction in Logic Programming, MIT Press, London, 1989.
44. Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems, in Proceedings AAAI-94, 1994.