Making dependency-directed search hierarchical
Abstract: "This paper concerns search algorithms for combinatorial problems including constraint satisfaction problems (CSPs). When good ordering heuristics are not available for a CSP, dependency- directed search is desirable for computing all solutions in multiple contexts to avoid redundant...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
593 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "This paper concerns search algorithms for combinatorial problems including constraint satisfaction problems (CSPs). When good ordering heuristics are not available for a CSP, dependency- directed search is desirable for computing all solutions in multiple contexts to avoid redundant computation. However, previous works on dependency-directed search fail to model or capture the incremental construction of hierarchical structure with various levels of complex and/or large-scale problem solving. Our idea is based on AND/OR tree search underlying the assumption-based truth maintenance system (ATMS). In the ATMS, a context is characterized by a combination of choices (assumptions), without information of hierarchy In AND/OR tree search procedures, a context can be characterized by a partial solution tree and thus reflects a tree structure. We show the connection between these two approaches. A proposed search algorithm called HDDS improves the search efficiency and the expressive power more than previous methods. |
|---|---|
| Beschreibung: | 13 S. |