Sciweavers

Share
AAAI
1996

Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search

8 years 3 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving communities. In this paper, I formalize and unify these ideas under the task-independent framework of refinement search, which can model the search strategies used in both planning and constraint satisfaction. I show that both DDB and EBL depend upon the common theory of explaining searchfailures,and regressing them to higher levels of the search tree. The relevant issues of importance include (a) how the failures are explained and (b) how many failure explanations are remembered. This task-independentunderstandingof DDB and EBL helps support cross-fertilization of ideas among Constraint Satisfaction, Planning and Explanation-Based Learning communities.
Subbarao Kambhampati
Added 02 Nov 2010
Updated 02 Nov 2010
Type Conference
Year 1996
Where AAAI
Authors Subbarao Kambhampati
Comments (0)
books