| Presentation | 2002/5/17 Effective SAT Planning by Speculative Computation Hidetomo NABESHIMA, Koji IWANUMA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we propose an approach for improving efficiency of SAT planning by speculative execution of a systematic SAT solver. This approach can always discover a plan if it exists in a planning problem, and the length of the plan is only longer than the shortest plan at most specific constant. Furthermore, we show that this approach can enhance the effect of parallel execution. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | SAT planning / speculative computation |
| Paper # | AI2002-5 |
| Date of Issue |
| Conference Information | |
| Committee | AI |
|---|---|
| Conference Date | 2002/5/17(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Artificial Intelligence and Knowledge-Based Processing (AI) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Effective SAT Planning by Speculative Computation |
| Sub Title (in English) | |
| Keyword(1) | SAT planning |
| Keyword(2) | speculative computation |
| 1st Author's Name | Hidetomo NABESHIMA |
| 1st Author's Affiliation | Department of Computer Science and Media Engineering, Yamanashi University() |
| 2nd Author's Name | Koji IWANUMA |
| 2nd Author's Affiliation | Department of Computer Science and Media Engineering, Yamanashi University |
| Date | 2002/5/17 |
| Paper # | AI2002-5 |
| Volume (vol) | vol.102 |
| Number (no) | 91 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |