File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Au, Tsz-Chiu
- Agents & Robotic Transportation Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.conferencePlace | US | - |
| dc.citation.conferencePlace | ROBERT GORDON UNIV; ABERDEEN; SCOTLAND | - |
| dc.citation.endPage | 27 | - |
| dc.citation.startPage | 13 | - |
| dc.citation.title | 6th European Conference on Case-Based Reasoning (ECCBR) | - |
| dc.contributor.author | Au, Tsz-Chiu | - |
| dc.contributor.author | Munoz-Avila, Hector | - |
| dc.contributor.author | Nau, Dana S. | - |
| dc.date.accessioned | 2023-12-20T06:08:25Z | - |
| dc.date.available | 2023-12-20T06:08:25Z | - |
| dc.date.created | 2014-12-23 | - |
| dc.date.issued | 2002-09-04 | - |
| dc.description.abstract | In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a planning system. | - |
| dc.identifier.bibliographicCitation | 6th European Conference on Case-Based Reasoning (ECCBR), pp.13 - 27 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.scopusid | 2-s2.0-23044534057 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/34496 | - |
| dc.identifier.url | https://link.springer.com/chapter/10.1007%2F3-540-46119-1_3 | - |
| dc.language | 영어 | - |
| dc.publisher | ECCBR | - |
| dc.title | On the complexity of plan adaptation by derivational analogy in a universal classical planning framework | - |
| dc.type | Conference Paper | - |
| dc.date.conferenceDate | 2002-09-04 | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.