Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach , 1996, Artif. Intell..
[2] Matthew L. Ginsberg,et al. GSAT and dynamic backtracking , 1994, KR 1994.
[3] Rina Dechter,et al. Dead-End Driven Learning , 1994, AAAI.
[4] Gerald J. Sussman,et al. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..
[5] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[7] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[8] Gerald DeJong,et al. COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-Up Learning , 1992, AAAI.
[9] S. Kambhampati,et al. Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .
[10] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..
[11] Charles J. Petrie,et al. Constrained Decision Revision , 1992, AAAI.
[12] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[13] Jesfis Peral,et al. Heuristics -- intelligent search strategies for computer problem solving , 1984 .
[14] Oren Etzioni,et al. Explanation-Based Learning: A Problem Solving Perspective , 1989, Artif. Intell..
[15] Steven Minton,et al. Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..