An analysis on transformational analogy: general framework and complexity

Authors:
Vithal Kuchibatla;Héctor Muñoz-Avila
Affiliations:
Department of Computer Science & Engineering, Lehigh University, Bethlehem, PA;Department of Computer Science & Engineering, Lehigh University, Bethlehem, PA
Venue:
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Year:
2006

Citing 8
Cited 3

Explaining and repairing plans that fail

Artificial Intelligence
Plan reuse versus plan generation: a theoretical and empirical analysis

Artificial Intelligence - Special volume on planning and scheduling
Planning and Learning by Analogical Reasoning

Planning and Learning by Analogical Reasoning
Knowledge Engineering Requirements in Derivational Analogy

EWCBR '93 Selected papers from the First European Workshop on Topics in Case-Based Reasoning
On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework

ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Case-based planning

The Knowledge Engineering Review
A domain-independent algorithm for plan adaptation

Journal of Artificial Intelligence Research
Design and implementation of a replay framework based on a partial order planner

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions

ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Constraint-Based Case-Based Planning Using Weighted MAX-SAT

ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Kernel functions for case-based planning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present TransUCP, a general framework for transformational analogy. Using our framework we demonstrate that transformational analogy does not meet a crucial condition for a well-known worst-case complexity scenario, and therefore the results about plan adaptation being computationally harder than planning from the scratch does not apply to transformational analogy. We prove this by constructing a counter-example that does not meet this condition. Furthermore, we perform experiments that demonstrate that this counter-example is not an exception. Rather, our experiments show that it is unlikely that this condition will be met when performing plan adaptation with transformational analogy.