On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning

Artificial Intelligence

Volumn 105, Issue 1-2, 1998, Pages 161-208

  Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

Constraint satisfaction; Dependency directed backtracking; Dynamic backtracking; Explanation based learning; Flaw resolution; Nogood learning; Planning; Propagation; Regression

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECISION THEORY; FAULT TREE ANALYSIS; LEARNING SYSTEMS; REGRESSION ANALYSIS;

CONSTRAINT SATISFACTION PROBLEMS (CSP); FAILURE-DRIVEN EXPLANATION-BASED LEARNING (EBL); INTELLIGENT BACKTRACKING (IB);

ARTIFICIAL INTELLIGENCE;

EID: 0032179503     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(98)00087-3     Document Type: Article

References (60)

1. A. Baker, Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results, Ph.D. Thesis, University of Oregon, Eugene, OR, 1995.
2. R. Bayardo, D. Miranker, A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem, in: Proceedings AAAI-96, Portland, OR, 1996.
3. R. Bayardo, R. Schrag, Using csp look-back techniques to solve exceptionally hard sat instances, in: Ppls of Constraint Programming Languages, Lecture Notes in Comput. Sci., Vol. 1118, Springer, Berlin, 1996.
4. R. Bayardo, R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings AAAI-97, Providence, RI, 1997.
5. N. Bhatnagar, J. Mostow, On-line learning from search failures, Machine Learning 15 (1994) 69-117.
6. A. Blum, M. Furst, Fast planning through plan-graph analysis, in: Proceedings IJCAI-95, Montreal, Quebec, 1995.
7. M. Bruynooghe, Solving combinatorial search problems by intelligent backtracking, Inform. Process. Lett. 12 (1981) 36-39.
8. L. Daniel, Planning: modifying non-linear plans, Technical Report, DAI Working Paper 24, University of Edinburgh, Edinburgh, 1977.
9. R. Dechter, Enhancement schemes for learning: backjumping, learning and cutset decomposition, Artificial Intelligence 41 (1990) 273-312.
10. R. Dechter, A. Dechter, Belief maintenance in dynamic constraint networks, in: Proceedings AAAI-88, St. Paul, MN, 1988.
11. G. DeJong, The Computer Science and Engineering Handbook, CRC Press, Rockville, MD, 1996, Chapter 21.
12. T. Estlin, R. Mooney, Multi-strategy learning for search control for partial order planning, in: Proceedings AAAI-96, Portland, OR, 1996.
13. O. Etzioni, A structural theory of explanation-based learning, Artificial Intelligence 60 (1) (1993) 93-109.
14. O. Etzioni, S. Minton, Why EBL produces overly-specific knowledge: a critique of the prodigy approaches, in: Proceedings Machine Learning Conference, Aberdeen, Scotland, 1992.
15. D. Frost, R. Dechter, Deadend-driven learning, in: Proceedings AAAI-94, Seattle, WA, 1994.
16. D. Frost, R. Dechter, In search of the best constraint satisfaction search, in: Proceedings AAAI-94, Seattle, WA, 1994.
17. J. Gaschnig, A general backtrack algorithm that eliminates most redundant tests, in: Proceedings IJCAI-77, Cambridge, MA, 1977.
18. M. Ginsberg, Dynamic backtracking, J. Artificial Intelligence Research 1 (1993) 25-46.
19. M. Ginsberg, D. McAllester, GSAT and dynamic backtracking, in: Proceedings Fourth Internat. Conf. on the Principles of Knowledge Representation and Reasoning, Bonn, Germany, 1994.
20. J. Gratch, G. DeJong, Composer: a probabilistic solution to the utility problem in speed-up learning, in: Proceedings AAAI-92, San Jose, CA, 1992, pp. 235-240.
21. R. Greiner, PALO: a probabilistic hill-climbing algorithm, Artificial Intelligence 84 (1996) 177-208.
22. C.A.R. Hoare, Some properties of predicate transformers, Journal of the ACM 25 (1978) 461-480.
23. L. Ihrig, S. Kambhampati, Design and implementation of a derivational replay system based on a partial order planner, in: Proceedings AAAI-96, Portland, OR, 1996.
24. Y.J. Jiang, T. Richards, B. Richards, No-good backmarking with min-conflict repair in constraint satisfaction and optimization, in: Proceedings 2nd Principles and Practice of Constraint Programming Workshop, 1994.
25. D. Joslin, M. Pollack, Is least commitment always a good idea? in: Proceedings AAAI-96, Portland, OR, 1996.
26. S. Kambhampati, Admissible pruning strategies for plan-space planners, in: Proceedings IJCAI-95, Montreal, Quebec, 1995.
27. S. Kambhampati, Formalizing dependency directed backtracking and explanation-based learning in refinement search, in: Proceedings AAAI-96, Portland, OR, 1996.
28. S. Kambhampati, Refinement planning as a unifying framework for plan synthesis, AI Magazine 18 (2) (1997).
29. S. Kambhampati, EBL and DDB for Graphplan, Technical Report ASU CSE TR 98-008, Arizona State University, AZ, August 1998; URL: rakaposhi@eas.asu.edu/gp-ebl-tr.ps.
30. S. Kambhampati, S. Katukam, Y. Qu, Failure driven dynamic search control for partial order planners: an explanation-based approach, Artificial Intelligence 88 (1996) 253-315.
31. S. Kambhampati, C. Knoblock, Q. Yang, Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning, Artificial Intelligence (Special Issue on Planning and Scheduling) 76 (1995) 167-238.
32. S. Kambhampati, E. Parker, E. Lambrecht, Understanding and extending graphplan, in: Proceedings 4th European Conference on Planning Systems, 1997.
33. S. Kambhampati, B. Srivastava, Universal classical planner: an algorithm for unifying state-space and planspace planning, in: Proceedings 3rd European Workshop on Planning Systems, 1995.
34. S. Kambhampati, X. Yang, Role of disjunctive representations and constraint propagation in planning, in: Proceedings KR-96, 1996.
35. H. Kautz, B. Selman, Pushing the envelope: planning, propositional logic and stochastic search, in: Proceedings AAAI-96, Portland, OR, 1996.
36. H. Kautz, B. Selman, D. McAllester, Encoding plans in propositional logic, in: Proceedings KR-96, 1996.
37. G. Kondrak, P. van Beek, A theoretical evaluation of selected backtracking algorithms, in: Proceedings IJCAI-95, Montreal, Quebec, 1995.
38. S. Letovsky, Operationality criteria for recursive predicates, in: Proceedings AAAI-90, Boston, MA, 1990.
39. D. McAllester, Partial-order dynamic backtracking, http://www.ai.mit.edu/people/dam/dynamic.ps, 1993.
40. D. McAllester, D. Rosenblitt, Systematic nonlinear planning, in: Proceedings AAAI-91, Anaheim, CA, 1991.
41. S. Minton, Quantitative results concerning the utility of explanation-based learning, Artificial Intelligence 42 (1990) 363-391.
42. S. Minton, J.G. Carbonell, C.A. Knoblock, D.R. Kuokka, O. Etzioni, Y. Gil, Explanation-based learning: a problem solving perspective, Artificial Intelligence 40 (1989) 63-118.
43. S. Mittal, B. Falkenhainer, Dynamic constraint satisfaction problems, in: Proceedings AAAI-90, Boston, MA, 1990.
44. H. Munoz-Avila, F. Weberskirsch, Planning for manufacturing workpieces by storing, indexing and replaying planning decisions, in: Proceedings 3rd International Conference on AI Planning Systems, 1996.
45. N. Muscettola, S. Smith, A. Cesta, D. D'Aloisi, Coordinating space telescope operations in an integrated planning and scheduling architecture, in: Proceedings IEEE International Conference on Robotics and Automation, 1991.
46. N.J. Nilsson, Principles of Artificial Intelligence, Tioga Press, Palo Alto, CA, 1980.
47. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA, 1984.
48. C. Petrie, Constrained decision revision, in: Proceedings AAAI-92, San Jose, CA, 1992.
49. P. Prosser, Domain filtering can degrade intelligent backtracking search, in: Proceedings IJCAI-93, Chambéry, France, 1993.
50. T. Schiex, G. Verfaille, Stubbornness: a possible enhancement for backjumping and nogood recordings, in: Proceedings ECAI-94, Amsterdam, 1994.
51. T. Schiex, G. Verfaillie, Nogood recording for static and dynamic constraint satisfaction problems, in: Proceedings 5th International Conference on Tools with Artificial Intelligence, 1993.
52. B. Selman, H. Levesque, D.G. Mitchel, GSAT: a new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA, 1992.
53. D. Smith, M. Peot, Suspending recursion in planning, in: Proceedings 3rd International Conference on AI Planning Systems, 1996.
54. R. Stallman, G. Sussman, Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis, Artificial Intelligence 9 (1977) 135-196.
55. R.M. Keller, T.M. Mitchell, S.T. Kedar-Cabelli, Explanation-based learning: a unifying view, Machine Learning 1 (1) (1986) 47-80.
56. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, San Diego, CA, 1993.
57. F. van Harmelen, A. Bundy, Explanation-based generalisation = partial evaluation, Artificial Intelligence 36 (1988) 401-412.
58. G. Verfaillie, T. Schiex, Solution reuse in dynamic constraint satisfaction problems, in: Proceedings AAAI-94, Seattle, WA, 1994.
59. Q. Yang, A theory of conflict resolution in planning, Artificial Intelligence 58 (1992) 361-392.
60. T. Zimmerman, S. Kambhampati, Using unsound failure explanations to improve the effectiveness of EBL, in preparation.