摘要: Abstract A persistent problem in machine planning is that of repairing plans fail. One approach to this has been shown be quite powerful based on the idea detailed descriptions causes a failure can used decide between different repairs applied. This paper presents an repair which plan failures are described terms causal explanations why they occurred. These domain-level access abstract strategies, then make specific changes faulty plans. The demonstrated using examples from CHEF, case-based planner creates and debugs domain Szechwan cooking. While discussed here examined actual failures, technique also discovered prior their running.
core.ac.uk
elsevier.com
sci-hub.se 参考文章(22)
K. Hammond, Indexing and Causality: The Organization of Plans and Strategies in Memory Unknown Publisher. ,(1984)
Jaime G. Carbonell, A computational model of analogical problem solving international joint conference on artificial intelligence. pp. 147- 152 ,(1981)
Austin Tate, Generating project networks international joint conference on artificial intelligence. pp. 888- 893 ,(1977)
Kristian J. Hammond, Case-Based Planning: Viewing Planning as a Memory Task ,(1989)
Robert Wilensky, Understanding goal-based stories ,(1980)
Koton Phyllis, Using experience in learning and problem solving Massachusetts Institute of Technology. ,(1988)
Schank Roger C, Dynamic Memory: A Theory of Reminding and Learning in Computers and People ,(1983)
Roger C. Schank, Robert P. Abelson, Scripts, plans, and knowledge international joint conference on artificial intelligence. pp. 151- 157 ,(1975)
Gerald Jay Sussman, A Computer Model of Skill Acquisition ,(1975)
Jaime Guillermo Carbonell, Subjective understanding, computer models of belief systems ,(1981)