Abstract
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 search failures, 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-independent understanding of DDB and EBL helps support cross-fertilization of ideas among Constraint Satisfaction, Planning and Explanation-Based Learning communities.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the National Conference on Artificial Intelligence |
| Editors | Anon |
| Place of Publication | Menlo Park, CA, United States |
| Publisher | AAAI |
| Pages | 757-762 |
| Number of pages | 6 |
| Volume | 1 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2) - Portland, OR, USA Duration: Aug 4 1996 → Aug 8 1996 |
Other
| Other | Proceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2) |
|---|---|
| City | Portland, OR, USA |
| Period | 8/4/96 → 8/8/96 |
ASJC Scopus subject areas
- Software