References

1

R. Barletta and W. Mark.
Explanation-based indexing of cases.
In Proceedings AAAI-88, 1988.

2

A. Barrett and D. Weld.
Partial order planning: evaluating possible efficiency gains.
Artificial Intelligence, 67:71-112, 1994.

3

R. Bergmann and W. Wilke.
Building and refining abstract planning cases by change of representation language.
Journal of Artificial Intelligence Research, 3:53-118, 1995.

4

J. Carbonell.
Learning by analogy: Formulating and generalizing plans from past experience.
In R. Michalski, J. Carbonell, and T. Mitchell, editors, Machine Learning: an Artificial Intelligence approach, volume 1. Palo Alto, CA: Tioga Press, 1983.

5

G. DeJong and R. Mooney.
Explanation-based learning: An alternative view.
Machine Learning, 1(2):145-176, 1986.

6

R. Doorenbos.
Production Matching for Large Learning Systems.
PhD thesis, Computer Science Department, Carnegie Mellon University, 1995.

3

R. Fikes and N. Nilsson.
A new approach to the application of theorem proving to problem solving.
Artificial Intelligence, 2:189-208, 1971.

4

S. Fox and D. Leake.
Using introspective reasoning to refine indexing.
In Proceedings IJCAI-95, 1995.

5

A. Francis and S. Ram.
A comparative utility analysis of case-based reasoning and control-rule learning systems.
In Proceedings of the 8th European Conference on Machine Learning, ECML-95, 1995.

6

P. Friedland and Y. Iwasaki.
The concept and implementation of skeletal plans.
Journal of Automated Reasoning, 1(2):161-208, 1985.

11

J. Gratch and G. DeJong.
Composer: A probabilistic solution to the utility problem in speed-up learning.
In Proceedings AAAI-92, 1992.

12

K. Hammond.
Explaining and repairing plans that fail.
Artificial Intelligence, 45:173-228, 1990.

7

S. Hanks and D. Weld.
A domain-independent algorithm for plan adaptation.
Journal of Artificial Intelligence Research, 2:319-360, 1995.

14

J. Hendler, K. Stoffel, and A. Mulvehill.
High performance support for case-based planning applications.
In Technological Achievements of the Arpa/Rome Laboratory Planning Initiative: Advanced Planning Technology. AAAI Press, 1996.

8

L. Ihrig and S. Kambhampati.
Derivation replay for partial-order planning.
In Proceedings AAAI-94, 1994.

9

L Ihrig and S. Kambhampati.
Plan-space vs state-space planning in reuse and replay.
Technical Report 94-006, Department of Computer Science and Engineering, 1994.
Arizona State University. Also available at http://rakaposhi.eas.asu.edu/yochan.html.

10

L. Ihrig and S. Kambhampati.
Design and implementation of a replay framework based on a partial order planner.
In Proceedings AAAI-96, 1996.

11

D. Joslin and J. Roach.
A theoretical analysis of conjunctive goal problems.
Artificial Intelligence, 41:97-106, 1990.

19

S. Kambhampati.
Utility tradeoffs in incremental modification and reuse of plans.
In Proceedings AAAI Spring Symposium on Computational Considerations in Supporting Incremental Modification and Reuse, 1992.

20

S. Kambhampati.
Exploiting causal structure to control retrieval and refitting during plan reuse.
Computational Intelligence, 10, 1994.

12

S. Kambhampati and J. Chen.
Relative utility of ebg based plan reuse in partial ordering vs total ordering planning.
In Proceedings AAAI-93, pages 514-519, 1993.
Washington, D.C.

13

S. Kambhampati and J. A. Hendler.
A validation structure based theory of plan modification and reuse.
Artificial Intelligence, 55:193-258, 1992.

14

S. Kambhampati, L. Ihrig, and B. Srivastava.
A candidate set based analysis of subgoal interactions in conjunctive goal planning.
In Proceedings of the 3rd Intl. Conf. on AI Planning Systems, 1996.

15

S. Kambhampati, S. Katukam, and Y. Qu.
Failure driven dynamic search control for partial order planners: An explanation-based approach.
Artificial Intelligence, 88:253-315, 1996.

25

S. Kambhampati, C. Knoblock, and Q. Yang.
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.
Artificial Intelligence, 76:167-238, 1995.

26

J. Koehler.
Avoiding pitfalls in case-based planning.
In Proceedings of the 2nd Intl. Conf. on AI Planning Systems, 1994.

27

R. Korf.
Planning as search: a qualitative approach.
Artificial Intelligence, 33:65-68, 1987.

16

D. McAllester and D Rosenblitt.
Systematic nonlinear planning.
In Proceedings AAAI-91, 1991.

29

S. Minton.
Issues in the design of operator composition systems.
In Proceedings of the International conference on Machine Learning, 1990.

30

S. Minton.
Quantitative results concerning the utility of explanation-based learning.
Artificial Intelligence, 42:363-392, 1990.

17

J. Mostow and N. Bhatnagar.
Failsafe: A floor planner that uses ebg to learn from its failures.
In Proceedings IJCAI-87, 1987.

32

H. Munoz-Avilla and F. Weberskirch.
Planning for manufacturing workpieces by storing, indexing and replaying planning decisions.
In Proceedings of the 3rd Intl. Conf. on AI Planning Systems. AAAI-Press, 1996.

33

H. Munoz-Avilla and F. Weberskirch.
A case study on mergeability of cases with a partial-order planner.
In Proceedings of the 4th European Conf. on Planning, 1997.

18

A. Ram and M. Cox.
Introspecive reasoning using meta-explanations for multistrategy learning.
In R. Michalski and G. Tecuci, editors, Machine Learning: A multistrategy approach Vol. IV. Morgan Kaufmann, 1994.

19

S. Ram and A. Francis.
Multi-plan retrieval and adaptation in an experience-based agent.
In David B. Leake, editor, Case-Based Reasoning: experiences, lessons, and future directions. AAAI Press/The MIT Press, 1996.

36

M. Redmond.
Distributed cases for case-based reasoning:facilitating use of multiple cases.
In Proceedings AAAI-90, 1990.

20

B Smyth and M Keane.
Remembering to forget: A competence-preserving deletion policy for cbr.
In Proceedings IJCAI-95, 1995.

38

N. Tambe, A. Newell, and P. Rosenbloom.
The problem of expensive chunks and its solution by restricting expressiveness.
Machine Learning, 5:299-349, 1990.

39

A. Tate.
Generating project networks.
In Proceedings IJCAI-77, 1977.

40

M. Veloso.
Planning and learning by analogical reasoning.
Springer Verlag, 1994.
Number 886 in Lecture Notes in Artificial Intelligence.

21

M. Veloso and J. Blythe.
Linkability: Examining causal link commitments in partial-order planning.
In Proceedings of the 2nd Intl. Conf. on AI Planning Systems, 1994.

22

M. Veloso and J. Carbonell.
Derivational analogy in prodigy: Automating case acquisition, storage and utilization.
Machine Learning, 10:249-278, 1993.

23

M. Veloso and J Carbonell.
Toward scaling up machine learning: A case study with derivational analogy in PRODIGY.
In S. Minton, editor, Machine Learning methods for planning. Morgan Kaufmann, 1993.

24

Q. Yang, D. Nau, and J. Hendler.
Merging separately generated plans with restricted interactions.
Computational Intelligence, 8(2):648-676, 1992.