John A. Allen, Pat Langley and Stan Matwin. Knowledge and regularity in planning. In Proceedings of the AAAI 1992 Spring Symposium on Computational Considerations in Supporting Incremental Modification and Reuse, pages 7-12, 1992.

John A. Allen and Steven Minton. Selecting the Right Heuristic Algorithm: Runtime Performance Predictors. In Gordon McCalla, editor, Advances in Artificial Intelligence: The Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 41-53. Springer, Berlin, Germany, 1996.

Saul Amarel. An approach to automatic theory formation. In Heinz M. Von Foerster, editor, Principles of Self-Organization: Transactions. Pergamon Press, New York, NY, 1961.

Saul Amarel. Problem solving procedures for efficient syntactic analysis. In ACM Twentieth National Conference, 1965.

Saul Amarel. On representations of problems of reasoning about actions. In Donald Michie, editor, Machine Intelligence 3, pages 131-171. American Elsevier Publishers, New York, NY, 1968.

Saul Amarel.  Representations and modeling in problems of program formation. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 6, pages 411-466. American Elsevier Publishers, New York, NY, 1971.

Martin Anthony and Norman Biggs. Computational Learning Theory. Cambridge University Press, Cambridge, United Kingdom, 1992.

Fahiem Bacchus and Yee Whye Teh. Making forward chaining relevant. In Proceedings of the Fourth International Conference on AI Planning Systems, pages 54-61, 1998.

Fahiem Bacchus and Qiang Yang. The downward refinement property. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 286-291, 1991.

Fahiem Bacchus and Qiang Yang. The expected value of hierarchical problem-solving. In Proceedings of the Tenth National Conference on Artificial Intelligence, 1992.

Fahiem Bacchus and Qiang Yang. Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71(1), pages 43-100, 1994.

Christer Backstrom and Peter Jonsson. Planning with abstraction hierarchies can be exponentially less efficient. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1599-1604, 1995.

Anthony Barrett and Daniel S. Weld. Partial order planning: Evaluating possible efficiency gains. Department of Computer Science, University of Washington, 92-05-01, 1992.

Anthony Barrett and Daniel S. Weld. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67(1), pages 71-112, 1994.

Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1636-1642, 1995.

Avrim L. Blum and Merrick L. Furst. Fast planning through planning graph analysis. Artificial Intelligence,  90(1-2), pages 281-300, 1997.

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler and Manfred K. Warmuth. Occam's razor. Information Processing Letters, 24, pages 377-380, 1987.

Jim Blythe and Eugene Fink. From PRODIGY 1 to RASPUTIN: Illustrated story of bidirectional planners. Technical Report CMU-CS-97-102, Department of Computer Science, Carnegie Mellon University, 1997.

Jim Blythe and W. Scott Reilly. Integrating reactive and deliberative planning in a household robot. AAAI Fall Symposium on Instantiating Real-World Agents, 1993.

Jim Blythe and W. Scott Reilly. Integrating Reactive and Deliberative Planning for Agents. Technical Report CMU-CS-93-155, School of Computer Science, Carnegie Mellon University, 1993.

Jim Blythe and Manuela M. Veloso. An analysis of search techniques for a totally-ordered nonlinear planner. In Proceedings of the First International Conference on AI Planning Systems, pages 13-19, 1992.

D. A. Boehm-Davis, R. W. Holt, M. Koll, G. Yastrop and R. Peters. Effects of different database formats on information retrieval. Human Factors, 31, pages 579-592, 1989.

Daniel Borrajo and Manuela Veloso. Lazy incremental learning of control knowledge for efficiently obtaining quality plans. Artificial Intelligence Review, 10, pages 1-34, 1996.

John S. Breese and Eric J. Horvitz. Ideal reformulation of belief networks. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, pages 64-72, 1990.

Jaime G. Carbonell. Learning by analogy: Formulating and generalizing plans from past experience. In Ryszard S. Michalski, Jaime G. Carbonell and Tom M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach. Tioga Publishers, Palo Alto, CA, 1983.

Jaime G. Carbonell. Machine Learning: Paradigms and Methods. MIT Press, Boston, MA, 1990.

Jaime G. Carbonell and Yolanda Gil. Learning by experimentation: The operator refinement method. In R. S. Michalski and Y. Kodratoff, editors, Machine Learning: An Artificial Intelligence Approach, pages 191-213. Morgan Kaufmann, Palo Alto, CA, 1990.

Jaime G. Carbonell, Craig A. Knoblock and Steven Minton. PRODIGY: An integrated architecture for planning and learning. In Kurt VanLehn, editor, Architectures for Intelligence, pages 241-278. Lawrence Erlbaum Associates, Hillside, NJ, 1991.

Jaime G. Carbonell, Jim Blythe, Oren Etzioni, Yolanda Gil, Robert Joseph, Dan Kahn, Craig A. Knoblock, Steven Minton, Alicia Perez, Scott Reilly, Manuela M. Veloso and Xuemei Wang. PRODIGY 4.0: The manual and tutorial. Technical Report CMU-CS-92-150, School of Computer Science, Carnegie Mellon University, 1992.

B. A. Carre. An algebra for network routing problems. Journal of the Institute of Mathematics and Its Applications, 7, pages 273-294,1971.

P. P. Chakrabarti, S. Ghose, Arup Acharya, S. C. Sarkar. Heuristic search in restricted memory. Artificial Intelligence, 41(2), pages 199-221, 1989.

David Chapman. Planning for conjunctive goals. Artificial Intelligence, 32, pages 333-377, 1987.

Patricia W. Cheng and Jaime G. Carbonell. The FERMI system: Inducing iterative macro-operators from experience. In Proceedings of the Fifth National Conference on Artificial Intelligence, pages 490-495, 1986.

Jens Christensen. A hierarchical planner that generates its own abstraction hierarchies. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 1004-1009, 1990.

Paul R. Cohen. Empirical Methods for Artificial Intelligence. MIT Press, Cambridge, MA, 1995.

William W. Cohen. Using distribution-free learning theory to analyze solution-path caching mechanisms. Computational Intelligence, 8(2), pages 336-375, 1992.

William W. Cohen, Russell Greiner and Dale Schuurmans. Probabilistic hill-climbing. In S.J. Hanson, T. Petsche, M. Kearns and R.L. Rivest, editors, Computational Learning Theory and Natural Learning Systems, II, pages 171-181. MIT Press, Boston, MA, 1994.

Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.

Michael T. Cox and Manuela M. Veloso. Controlling for unexpected goals when planning in a mixed-initiative setting. In E. Costa and A. Cardoso, editors, Progress in Artificial Intelligence: Eighth Portuguese Conference on Artificial Intelligence, pages 309-318. Springer-Verlag, Berlin, Germany, 1997.

Michael T. Cox and Manuela M. Veloso. Supporting combined human and machine planning: An interface for planning by analogical reasoning. In D. B. Leake and E. Plaza, editors, Case-Based Reasoning Research and Development: Second International Conference on Case-Based Reasoning, pages 531-540. Springer-Verlag, Berlin, Germany, 1997.

George A. Drastal, Russell Greiner, Stephen J. Hanson, Michael Kearns, Thomas Petsche, Ronald L. Rivest and Jude W. Shavlik. Computational Learning Theory and Natural Learning Systems, I-IV. MIT Press, Boston, MA, 1994-1997.

Robert Driskill and Jaime G. Carbonell. Search Control in Problem Solving: A Gapped Macro Operator Approach. Unpublished Manuscript, 1996.

K. Duncker. On problem solving. Psychological Monographs, 58, pages 1-113, 1945.

George M. Ernst and Michael M. Goldstein. Mechanical discovery of classes of problem-solving strategies. Journal of the American Association for Computing Machinery, 29(1), pages 1-23, 1982.

Kutluhan Erol, James Handler and Dana S. Nau. Htn planning: Complexity and expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 1123-1128, 1994.

Oren Etzioni. A structural theory of explanation-based learning. Ph.D. thesis, School of Computer Science, Carnegie Mellon University. Technical Report CMU-CS-90-185, 1990.

Oren Etzioni. An asymptotic analysis of speedup learning. In Proceedings of the Ninth International Conference on Machine Learning, pages 137-143, 1992.

Oren Etzioni. Acquiring search control knowledge via static analysis. Artificial Intelligence, 62(2), pages 255-301, 1993.

Oren Etzioni and Steven Minton. Why EBL produces overly-specific knowledge: A critique of the  PRODIGY  approaches. In Proceedings of the Ninth International Workshop on Machine Learning, pages 137-143, 1992.

Richard E. Fikes, Peter E. Hart and Nils J. Nilsson. Learning and executing generalized robot plans. Artificial Intelligence, 3(4), pages 251-288, 1972.

Richard E. Fikes and Nils J. Nilsson.  STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, 2, pages 189-208, 1971.

Richard E. Fikes and Nils J. Nilsson. STRIPS, a retrospective. Artificial Intelligence,  2, pages 227-232, 1993.

Eugene Fink. Justified plans and ordered hierarchies. Ph.D. thesis, Department of Computer Science, University of Waterloo. Technical Report CS-92-42, 1992.

Eugene Fink. Design of representation-changing algorithms. Technical Report  CMU-CS-95-120, School of Computer Science, Carnegie Mellon University, 1995.

Eugene Fink. Systematic approach to the design of representation-changing algorithms. In Proceedings of the Symposium on Abstraction, Reformulation and Approximation, pages 54-61, 1995.

Eugene Fink. Representation changes in AI problem solving. Thesis proposal,  Unpublished manuscript, 1995.

Eugene Fink. Statistical selection among problem-solving methods. Technical Report CMU-CS-97-101, Department of Computer Science, Carnegie Mellon University, 1997.

Eugene Fink. How to solve it automatically: Selection among problem-solving methods. In Proceedings of the Fourth International Conference on AI Planning Systems, pages 128-136,  1998.

Eugene Fink. Automatic representation changes in problem solving.  Technical Report CMU-CS-99-150, School of Computer Science, Carnegie Mellon University,  1999.

Eugene Fink and Jim Blythe. A complete bidirectional planner. In Proceedings of the Fourth International Conference on AI Planning Systems, pages 78-84, 1998.

Eugene Fink and Manuela M. Veloso. PRODIGY  planning algorithm. Technical Report CMU-CS-94-123, School of Computer Science, Carnegie Mellon University, 1994.

Eugene Fink and Manuela M. Veloso. Formalizing the PRODIGY planning algorithm. In Malik Ghallab and Alfredo Milani, editors, New Directions in AI Planning, pages 261-271. IOS Press, Amsterdam, Netherlands, 1996.

Eugene Fink and Qiang Yang. Automatically abstracting effects of operators. In Proceedings of the First International Conference on AI Planning Systems, pages 243-251, 1992.

Eugene Fink and Qiang Yang. Formalizing plan justifications. In Proceedings of the Ninth Conference of the Canadian Society for Computational Studies of Intelligence, pages 9-14, 1992.

Eugene Fink and Qiang Yang. Characterizing and automatically finding primary effects in planning. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 1374-1379, 1993.

Eugene Fink and Qiang Yang. A spectrum of plan justifications. In Proceedings of the AAAI 1993 Spring Symposium on Foundations of Automatic Planning, pages 29-33, 1993.

Eugene Fink and Qiang Yang. Forbidding preconditions and ordered abstraction hierarchies. In Proceedings of the AAAI 1993 Spring Symposium on Foundations of Automatic Planning, pages 34-38, 1993.

Eugene Fink and Qiang Yang. Search reduction in planning with primary effects. In Proceedings of the Workshop on Theory Reformulation and Abstraction, pages 39-55, 1994.

Eugene Fink and Qiang Yang. Automatically selecting and using primary effects in planning: Theory and experiments. Technical Report  CMU-CS-94-206, School of Computer Science, Carnegie Mellon University, 1994.

Eugene Fink and Qiang Yang. Planning with primary effects: Experiments and analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 1606-1611, 1995.

Eugene Fink and Qiang Yang. Automatically selecting and using primary effects in planning: Theory and experiments. Artificial Intelligence, 89, pages 285-315, 1997.

D. E. Foulser, Ming Li and Qiang Yang. Theory and algorithms for plan merging. Artificial Intelligence, 57, pages 143-182, 1992.

Dedre Gentner and Albert L. Stevens, editors. Mental Models. Lawrence Erlbaum Associates, Hillside, NJ, 1983.

Yolanda Gil. A specification of manufacturing processes for planning. Technical Report CMU-CS-91-179, School of Computer Science, Carnegie Mellon University, 1991.

Yolanda Gil. Acquiring domain knowledge for planning by experimentation. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1992. Technical Report CMU-CS-92-175.

Yolanda Gil and Alicia Perez. Applying a general-purpose planning and learning architectures to process planning. In Proceedings of the AAAI 1994 Fall Symposium on Planning and Learning, pages 48-52, 1994.

Fausto Giunchiglia and Toby Walsh. A theory of abstraction. Artificial Intelligence, 57, pages 323-389, 1992.

Fred Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.

Andrew G. Golding, Paul S. Rosenbloom and John E. Laird. Learning general search control from outside guidance. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence, pages 334-337, 1987.

Michael M. Goldstein. The mechanical discovery of problem-solving strategies. Ph.D. thesis, Computer Engineering Department, Case Western Reserve University, 1978.

Vu Ha and Peter Haddawy. Problem-focused incremental elicitation of multi-attribute utility models. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pages 215-222, 1997.

Karen Zita Haigh. Situation-dependent learning for interleaved planning and robot execution. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1998. Technical Report CMU-CS-98-108.

Karen Zita Haigh and Manuela M. Veloso. Interleaving planning and robot execution for asynchronous user requests. In Proceedings of the International Conference on Intelligent Robots and Systems, 1996.

Karen Zita Haigh and Manuela M. Veloso. High-level planning and low-level execution: Towards a complete robotic agent. Autonomous Agents, 1997.

Karen Zita Haigh and Manuela M. Veloso. Interleaving planning and robot execution for asynchronous user requests. Autonomous Robots, 5(1), pages 79-95, 1997.

Karen Zita Haigh and Manuela M. Veloso. Planning, execution and learning in a robotic agent. In Proceedings of the Fourth International Conference on AI Planning Systems, pages 120-127, 1998.

Rogers P. Hall. Understanding analogical reasoning: Computational approaches. Artificial Intelligence, 39, pages 39-120, 1987.

Eric A. Hansen and Shlomo Zilberstein. Monitoring the progress of anytime problem-solving. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 1229-1234, 1996.

Eric A. Hansen and Shlomo Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence, 126, pages 139-157, 2001.

Othar Hansson and Andrew Mayer. Heuristic search and evidential reasoning. In Proceedings of the Fifth Workshop on Uncertainty in Artificial Intelligence, pages 152-161, 1989.

David Haussler. Quantifying inductive bias: AI learning algorithms and valiant's learning framework. Artificial Intelligence, 36, pages 177-221, 1988.

John R. Hayes and Herbert A. Simon. Understanding written problem instructions. In L. W. Gregg, editor, Knowledge and Cognition. Lawrence Erlbaum Associates, Potomac, MD, pages 167-200, 1974.

John R. Hayes and Herbert A. Simon. The understanding process: Problem isomorphs. Cognitive Psychology, 8, pages  165-190, 1976.

John R. Hayes and Herbert A. Simon. Psychological difference among problem isomorphs. In N. J. Castellan, D. B. Pisoni G. R. Potts, editors, Cognitive Theory. Lawrence Erlbaum Associates, Hillside, NJ, 1977.

David Hibler. Implicit abstraction by thought experiments. In Proceedings of the Workshop on Theory Reformulation and Abstraction, pages 9-26, 1994.

Robert C. Holte. An analytical framework for learning systems. Ph.D. thesis, Artificial Intelligence Laboratory, University of Texas at Austin, 1988. Technical Report AI88-72.

Robert C. Holte, C. Drummond, M. B. Perez, Robert M. Zimmer and Alan J. MacDonald. Searching with abstractions: A unifying framework and new high-performance algorithm. In Proceedings of the Tenth Conference of the Canadian Society for Computational Studies of Intelligence, pages 263-270, 1994.

Robert C. Holte, M. B. Perez, Robert M. Zimmer and Alan J. MacDonald. Hierarchical A*: Searching abstraction hierarchies efficiently. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 530-535, 1996.

Robert C. Holte, T. Mkadmi, Robert M. Zimmer and Alan J. MacDonald. Speeding up problem solving by abstraction: A graph-oriented approach. Artificial Intelligence, 85, pages 321-361, 1996.

Eric J. Horvitz. Reasoning under varying and uncertain resource constraints. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 111-116, 1988.

John C. Hull. Options, Futures and Other Derivatives. Prentice Hall, Fourth edition, Upper Saddle River, NJ, 1999.

Donald R. Jones and David A. Schkade. Choosing and translating between problem representations. Organizational Behavior and Human Decision Processes, 61(2), pages 214-223, 1995.

Robert L. Joseph. Graphical knowledge acquisition for visually-oriented domains. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1992. Technical Report CMU-CS-92-188.

Andreas Junghanns and Jonathan Schaeffer. Single-agent search in the presence of deadlocks. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 419-424, 1998.

Andreas Junghanns and Jonathan Schaeffer. Domain-dependent single-agent search enhancements. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999.

Andreas Junghanns and Jonathan Schaeffer. Sokoban: Improving the search with relevance cuts. Journal of Theoretical Computing Science, 1999.

Subbarao Kambhampati and Biplav Srivastava. Universal classical planner: An algorithm for unifying state-space and plan-space planning. In Malik Ghallab and Alfredo Milani, editors, New Directions in AI Planning. IOS Press, Amsterdam, Netherlands, pages 261-271, 1996.

Subbarao Kambhampati and Biplav Srivastava. Unifying classical planning approaches. Technical Report 96-006, Department of Computer Science, Arizona State University, 1996.

Craig A. Kaplan. SWITCH: A simulation of representational change in the mutilated checkerboard problem. Technical Report C.I.P. 477, Department of Psychology, Carnegie Mellon University, 1989.

Craig A. Kaplan and Herbert A. Simon. In Search of insight. Cognitive Psychology, 22, pages 374-419, 1990.

Henry A. Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic and stochastic search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 1194-1201, 1996.

Henry A. Kautz and Bart Selman. The role of domain-specific knowledge in the planning as satisfiability framework. In Proceedings of the Fourth International Conference on AI Planning Systems, pages 181-189, 1998.

Craig A. Knoblock. Learning abstraction hierarchies for problem solving. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 923-928, 1990.

Craig A. Knoblock. Automatically generating abstractions for problem solving. Technical Report CMU-CS-91-120, School of Computer Science, Carnegie Mellon University, 1991.

Craig A. Knoblock. Search reduction in hierarchical problem solving. In Proceedings of the Ninth National Conference on Artificial Intelligence,  pages 686-691, 1991.

Craig A. Knoblock. An analysis of ABSTRIPS. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pages 126-135, 1992.

Craig A. Knoblock. Generating abstraction hierarchies: An automated approach to reducing search in planning. Kluwer Academic Publishers, Boston, MA, 1993.

Craig A. Knoblock. Automatically generating abstractions for planning. Artificial Intelligence, 68, pages 243-302, 1994.

Craig A. Knoblock, Steven Minton and Oren Etzioni. Integrating abstraction and explanation-based learning in PRODIGY. In Proceedings of the Ninth National Conference on Artificial Intelligence, pages 541-546, 1991.

Craig A. Knoblock, Josh Tenenberg and Qiang Yang. Characterizing abstraction hierarchies for planning. In Proceedings of the Ninth National Conference on Artificial Intelligence, pages 692-697 1991.

Craig A. Knoblock and Qiang Yang. Evaluating the trade-offs in partial-order planning algorithms. In Proceedings of the Tenth Conference of the Canadian Society for Computational Studies of Intelligence, pages 279-286, 1994.

Craig A. Knoblock and Qiang Yang. Relating the performance of partial-order planning algorithms to domain features. SIGART Bulletin, 6(1), pages 8-15, 1995.

Sven Koenig. Goal-directed acting with incomplete information. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1997. Technical Report CMU-CS-97-199.

Janet L. Kolodner. Retrieval and organization strategies in conceptual memory: A computer model. Lawrence Erlbaum Associates, Hillsdale, NJ, 1984.

Hyung Joon Kook and Gordon S. Novak. Representation of models for expert problem solving in physics. IEEE Transactions on Software Engineering, 3(1), pages 48-54, 1991.

Richard E. Korf. Toward a model of representation changes. Artificial Intelligence, 14, pages 41-78, 1980.

Richard E. Korf. Macro-operators: A weak method for learning. Artificial Intelligence, 26(1), pages 35-77, 1985.

Richard E. Korf. Learning to solve problems by searching for macro-operators. Putnam Publishing Inc., Boston, MA, 1985.

Richard E. Korf. Planning as search: A quantitative approach. Artificial Intelligence, 33, pages 65-88, 1987.

Daniel R. Kuokka. The deliberative integration of planning, execution and learning. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1990. Technical Report CMU-CS-90-135.

John E. Laird, Paul S. Rosenbloom and Allen Newell. Chunking in Soar: The anatomy of a general learning mechanism. Machine Learning, 1, pages 11-46, 1986.

John E. Laird, Allen Newell and Paul S. Rosenbloom. Soar: An architecture for general intelligence. Artificial Intelligence, 33, pages 1-64, 1987.

Pat Langley. Learning effective search heuristics. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, pages 419-421, 1983.

Jill H. Larkin, Frederick Reif, Jaime G. Carbonell and Angela Gugliotta. FERMI: A flexible expert reasoner with multi-domain inferencing. Cognitive Psychology, 12, pages 101-138, 1988.

Jill H. Larkin and Herbert A. Simon. Learning through growth of skill in mental modeling. In Proceedings of the Third Annual Conference of the Cognitive Science Society, pages 106-111, 1981.

Jill H. Larkin and Herbert A. Simon. Why a diagram is (sometimes) worth ten thousand words. Cognitive Science, 11, pages 65-99, 1987.

D. J. Lehmann. Algebraic structures for transitive closure. Theoretical Computer Science, 4, pages 59-76, 1977.

David A. McAllester and David Rosenblitt. Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence, pages 634-639, 1991.

William Mendenhall. Introduction to Probability and Statistics, Seventh edition. Duxbury Press, Boston, MA, 1987.

William Mendenhall, Robert J. Beaver and Barbara M. Beaver. Introduction to Probability and Statistics, Tenth edition. Duxbury Press, Boston, MA, 1999.

Steven Minton. Selectively Generalizing plans for problem-solving. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 596-599, 1985.

Steven Minton. Learning effective search control knowledge: An explanation-based approach. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1988. Technical Report CMU-CS-88-133.

Steven Minton. Learning Search Control Knowledge: An Explanation-Based Approach. Kluwer Academic Publishers, Boston, MA, 1988.

Steven Minton. Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42, pages 363-391, 1990.

Steven Minton. An analytical learning system for specialized heuristics. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 922-929, 1993.

Steven Minton. Integrating heuristics for constraint satisfaction problems: A case study. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 120-126, 1993.

Steven Minton. Automatically configuring constraint satisfaction programs: A case study. Constraints: An International Journal, 1,  pages 7-43, 1996.

Steven Minton. Configurable solvers: Tailoring general methods to specific applications. In Gert Smolka, editor, Principles and Practice of Constraint Programming. Springer, Berlin, Germany, pages 372-374, 1997.

Steven Minton, Dan R. Kuokka, Yolanda Gil, Robert L. Joseph and  Jaime G. Carbonell. PRODIGY 2.0: The manual and tutorial. Technical Report CMU-CS-89-146, School of Computer Science, Carnegie Mellon University, 1989.

Steven Minton, Jaime G. Carbonell, Craig A. Knoblock, Dan R. Kuokka, Oren Etzioni and Yolanda Gil. Explanation-based learning: A problem-solving perspective. Artificial Intelligence, 40, pages 63-118, 1989.

Steven Minton, John Bresina and Mark Drummond. Commitment strategies in planning: A comparative analysis. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 259-261, 1991.

Steven Minton, John Bresina and Mark Drummond. Total-order and partial-order planning: A comparative analysis. Journal of Artificial Intelligence Research, 2, pages 227-262, 1994.

Tom M. Mitchell, Paul E. Utgoff and Ranan B. Banerji. Learning by experimentation: acquiring and refining problem-solving heuristics. In Ryszard S. Michalski and Jaime G. Carbonell and Tom M. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, pages 163-190. Tioga Publishers, Palo Alto, CA, 1983.

Raymond J. Mooney. Generalizing the order of operators in macro-operators. In Proceedings of the Fifth International Conference on Machine Learning, pages 270-283, 1988.

Abdelillah Mouaddib and Shlomo Zilberstein. Knowledge-based anytime computation. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 775-781, 1995.

Martin Muhlpfordt and Ute Schmid. Synthesis of recursive functions with interdependent parameters. In Proceedings of the Workshop on Applied Learning Theory, pages 132-139, Kaiserslautern, Germany, 1998.

Balas K. Natarajan. Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo, CA,  1991.

Allen Newell. Limitations of the current stock of ideas about problem solving. In Allen K. Kent and Oren E. Taulbee, editors, Electronic Information Handling. Spartan Books, Washington, DC, 1965.

Allen Newell. On the representations of problems. Computer Science Research Reviews. Carnegie Institute of Technology, Pittsburgh, PA, 1966.

Allen Newell. Unified theories of cognition and the role of Soar. In John A. Michon and Aladin Akyurek, editors, Soar: A Cognitive Architecture in Perspective, pages 25-79. Kluwer Academic Publishers, Netherlands, 1992.

Allen Newell, J. Cliff Shaw and Herbert A. Simon. A variety of intelligent learning in a general problem solver. In Marshall C. Yovits, editor, International Tracts in Computer Science and Technology and Their Applications, 2, Self-Organizing Systems, pages 153-189. Pergamon Press, New York, NY,  1960.

Allen Newell and Herbert A. Simon. GPS, a program that simulates human thought. In H. Billing, editor, Lernende Automaten, pages 109-124. R. Oldenbourg, Munich, Germany, 1961.

Allen Newell and Herbert A. Simon. Human Problem Solving. Prentice Hall, Englewood Cliffs, NJ, 1972.

Nils J. Nilsson. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York, NY, 1971.

Nils J. Nilsson. Principles of Artificial Intelligence. Morgan Kaufmann, San Mateo, CA, 1980.

Gordon S. Novak. Creation of views for reuse of software with different data representations. IEEE Transactions on Software Engineering, 21(12), pages 993-1005, 1995.

S. Ohlsson. Restructuring revisited I: Summary and critique of the gestalt theory of problem solving. Scandinavian Journal of Psychology, 25, pages 65-78, 1984.

Jeffery M. Paige and Herbert A. Simon. Cognitive processes in solving algebra word problems. In B. Kleinmuntz, editor, Problem Solving. John Wiley and Sons, New York, NY, 1966.

Edwin P. D. Pednault. Extending conventional planning techniques to handle actions with context-dependent effects. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 55-59, 1988.

Edwin P. D. Pednault. Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4, pages 356-372, 1988.

Mark A. Peot and David E. Smith. Threat-removal strategies for partial-order planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 492-499, 1993.

J. Scott Penberthy and Daniel S. Weld. UCPOP: A sound, complete, partial-order planner for ADL. In Proceedings of the Third International Conference on Knowledge Representation in Reasoning, pages 103-114, 1992.

M. Alicia Perez. Learning search control knowledge to improve plan quality. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1995. Technical Report CMU-CS-95-175.

M. Alicia Perez and Jaime G. Carbonell. Automated acquisition of control knowledge to improve the quality of plans. Technical Report CMU-CS-93-142, School of Computer Science, Carnegie Mellon University, 1993.

M. Alicia Perez and Oren Etzioni. DYNAMIC: A new role for training problems in EBL. In D. Sleeman and P. Edwards, editors, Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, San Mateo, CA, 1992.

Donald Peterson. Re-representation and emergent information in three cases of problem solving. In Artificial Intelligence and Creativity, pages 81-92. Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.

Donald Peterson, editor. Forms of Representation. Exeter, United Kingdom, Intellect Books, 1996.

Ira Pohl. Bi-directional search. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 6, pages 127-140. American Elsevier Publishers, New York, NY, 1971.

George Polya. How to Solve It. Doubleday, Garden City, NY, Second edition, 1957.

Yulin Qin and Herbert A. Simon. Imagery and mental models in problem solving. In N. Hari Narayanan, editor, Proceedings of the AAAI 1992 Spring Symposium on Reasoning with Diagrammatic Representations. Stanford University, Palo Alto, CA, 1992.

Elain Rich and Kevin Knight. Artificial Intelligence. McGraw-Hill, New York, Second edition, 1991.

Stuart J. Russell. Fine-grained decision-theoretic search control. In Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, pages 436-442, 1990.

Stuart J. Russell. Efficient memory-bounded search methods. In Proceedings of the Tenth European Conference on Artificial Intelligence, pages 1-5, 1992.

Stuart J. Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, NJ, 1995.

Stuart J. Russell, Devika Subramanian and Ronald Parr. Provably bounded optimal agents. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 338-344, 1993.

Earl D. Sacerdoti. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5(2), pages 115-135, 1974.

Earl D. Sacerdoti. A Structure for Plans and Behavior. Elsevier Publishers, Amsterdam, Netherlands, 1977.

Roger C. Schank, Neil M. Goldman, Charles J. Rieger III and Christopher K. Riesbeck. Inference and paraphrase by computer. Journal of the Association for Computing Machinery, 22(3), pages 309-328, 1975.

Ute Schmid and Fritz Wysotzki. Induction of recursive program schemes. In Proceedings of the Tenth European Conference on Machine Learning, pages 214-226 1996.

Bart Selman, Henry A. Kautz and Bram Cohen. Local search strategies for satisfiability testing. In David S. Johnson and Michael A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, 1996.

Peter Shell and Jaime G. Carbonell. Towards a general framework for composing disjunctive and iterative macro-operators. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989.

Herbert A. Simon. The functional equivalence of problem solving skills. Cognitive Psychology, 7, pages 268-288, 1975.

Herbert A. Simon. Models of Thought, I. Yale University Press, New Haven, CT, 1979.

Herbert A. Simon. Models of Thought, II. Yale University Press, New Haven, CT, 1989.

Herbert A. Simon. The Sciences of the Artificial. MIT Press, Cambridge, MA, third edition, 1996.

Herbert A. Simon, K. Kotovsky and J. R. Hayes. Why are some problems hard? Evidence from the Tower of Hanoi. Cognitive Psychology, 17, pages 248-294, 1985.

Yury V. Smirnov. Hybrid algorithms for on-line search and combinatorial optimization problems. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1997. Technical Report CMU-CS-97-171.

David E. Smith and Mark A. Peot. A critical look at knoblock's hierarchy mechanism. In Proceedings of the First International Conference on AI Planning Systems, pages 307-308, 1992.

Mark Stefik. Planning with constraints (MOLGEN Part 1). Artificial Intelligence, 16(2), pages 111-140, 1981.

Peter Stone and Manuela M. Veloso. Learning to solve complex planning problems: Finding useful auxiliary problems. In Proceedings of the AAAI 1994 Fall Symposium on Planning and Learning, pages 137-141, 1994.

Peter Stone and Manuela M. Veloso. User-guided interleaving of planning and execution. In Malik Ghallab and Alfredo Milani, editors, New Directions in AI Planning, pages 103-112. IOS Press, Amsterdam, Netherlands, 1996.

Peter Stone, Manuela M. Veloso and Jim Blythe. The need for different domain-independent heuristics. In Proceedings of the Second International Conference on AI Planning Systems, pages 164-169, 1994.

Hermina J. M. Tabachneck. Computational differences in mental representations: Effects of mode of data presentation on reasoning and understanding. Ph.D. thesis, Department of Psychology, Carnegie Mellon University, 1992.

Hermina J. M. Tabachneck-Schijf, Anthony M. Leonardo and Herbert A. Simon. CaMeRa: A computational model of multiple representations. Cognitive Science, 21(3), pages 305-350, 1997.

Prasad Tadepalli and Balas K. Natarajan. A formal framework for speedup learning from problems and solutions. Journal of Artificial Intelligence Research, 4, pages 445-475, 1996.

Milind Tamble, Allen Newell and Paul S. Rosenbloom. The problem of expensive chunks and its solution by restricting expressiveness. Machine Learning, 5, pages 299-348, 1990.

Austin Tate. Project planning using a hierarchical nonlinear planner. Technical Report 25, Department of Artificial Intelligence, University of Edinburg, 1976.

Austin Tate. Generating project networks. In Proceedings of the Second International Joint Conference on Artificial Intelligence, pages 888-900, 1977.

Josh D. Tenenberg. Abstraction in planning. Ph.D. thesis, Department of Computer Science, University of Rochester, 1988. Technical Report 250.

Amy Unruh and Paul S. Rosenbloom. Abstraction in problem solving and learning. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 681-687, 1989.

Amy Unruh and Paul S. Rosenbloom. Two new weak method increments for abstraction. In Proceedings of the Workshop on Automatic Generation of Approximations and Abstractions, 1990.

Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27, pages 1134-1142, 1984.

Jeffreybox Van Baalen. Toward a theory of representation design. Ph.D. thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1989. Technical Report 1128.

Manuela M. Veloso. Nonlinear problem solving using intelligent casual commitment. Technical Report CMU-CS-89-210, School of Computer Science, Carnegie Mellon University, 1989.

Manuela M. Veloso. Planning and Learning by Analogical Reasoning. Springer-Verlag, Berlin, Germany, 1994.

Manuela M. Veloso and Jim Blythe. Linkability: Examining casual link commitments in partial-order planning. In Proceedings of the Second International Conference on AI Planning Systems, pages 170-175, 1994.

Manuela M. Veloso and Daniel Borrajo. Learning strategy knowledge incrementally. In Proceedings of the Sixth International Conference on Tools with Artificial Intelligence, pages 484-490, 1994.

Manuela M. Veloso and Jaime G. Carbonell. Integrating analogy into a general problem-solving architecture. In M. Zemankova and Z. Ras, editors, Intelligent Systems, pages 29-51. Ellis Horwood, Chichester, United Kingdom, 1990.

Manuela M. Veloso and Jaime G. Carbonell. Derivational analogy in PRODIGY: Automating case acquisition, storage and utilization. Machine Learning, 10, pages 249-278, 1993.

Manuela M. Veloso and Jaime G. Carbonell. Towards scaling up machine Learning: A case study with derivational analogy in PRODIGY. In M. Zemankova and Z. Ras, editors, Machine Learning Methods for Planning, pages 233-272. Morgan Kaufmann, San Mateo, CA, 1993.

Manuela M. Veloso, Jaime G. Carbonell, M. Alicia Perez, Daniel Borrajo, Eugene Fink and Jim Blythe. Integrating planning and learning: The PRODIGY architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7(1), pages 81-120, 1995.

Manuela M. Veloso, Alice M. Mulvehill and Michael T. Cox. Rationale-supported mixed-initiative case-based planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 1072-1077, 1997.

Manuela M. Veloso and Peter Stone. FLECS: Planning with a flexible commitment strategy. Journal of Artificial Intelligence Research, 3, pages 25-52, 1995.

Xuemei Wang. Constraint-based efficient matching in PRODIGY. Technical Report CMU-CS-92-128, School of Computer Science, Carnegie Mellon University, 1992.

Xuemei Wang. Learning planning operators by observation and practice. In Proceedings of the Second International Conference on AI Planning Systems, pages 335-340, 1994.

Xuemei Wang. Learning planning operators by observation and practice. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, 1996. Technical Report CMU-CS-96-154.

D. H. D. Warren. WARPLAN: A system for generating plans. Technical Report Memo 76, Department of Computational Logic, University of Edinburg, 1974.

Daniel S. Weld. An introduction to least commitment planning. AI Magazine, 15(4), pages 27-61, 1994.

David E. Wilkins. Domain-independent planning: Representation and plan generation. Artificial Intelligence, 22(3), pages 269-301, 1984.

David E. Wilkins. Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann, San Mateo, CA, 1988.

David E. Wilkins and Karen L. Myers. A common knowledge representation for plan generation and reactive execution. Journal of Logic and Computation, 5(6), pages 731-761, 1995.

David E. Wilkins and Karen L. Myers. A multiagent planning architecture. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, pages 154-162, 1998.

David E. Wilkins, Karen L. Myers, J. D. Lowarance and L. P. Wesley. Planning and reacting in uncertain and dynamic environments. Journal of Experimental and Theoretical Artificial Intelligence, 7(1), pages 197-227, 1995.

Derick Wood. Data Structures, Algorithms and Performance. Addison-Wesley Publishers, Reading, MA, 1993.

Seiji Yamada and Saburo Tsuji. Selective learning of macro-operators with perfect causality. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 603-608, 1989.

Qiang Yang. Intelligent Planning: A Decomposition and Abstraction Based Approach. Springer-Verlag, Berlin, Germany, 1997.

Qiang Yang and Cheryl Murray. An evaluation of the temporal coherence heuristic in partial-order planning. Computational Intelligence, 10(3), pages 245-267, 1994.

Qiang Yang and Josh Tenenberg. ABTWEAK: Abstracting a non-linear, least-commitment planner. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 204-209, Boston, MA, 1990.

Qiang Yang, Josh Tenenberg and Steve Woods. On the implementation and evaluation of ABTWEAK. Computational Intelligence, 12(2),  pages 295-318, 1994.

Qiang Yang, Philip Fong and Edward Kim. Design patterns for planning systems. In Proceedings of the 1998 AIPS Workshop on Knowledge Engineering and Acquisition for Planning: Bridging Theory and Practice, pages 104-112, 1998.

Sara. In Michael R. Lowry, editor, Proceedings of the Workshop on Change of Representation and Problem Reformulation, NASA Ames Research Center, 1992. Technical Report FIA-92-06.

Sara. In Jeffrey Van Baalen, editor, Proceedings of the Workshop on Theory Reformulation and Abstraction, Computer Science Department, University of Wyoming, 1994. Technical Report 123.

Sara. In Alon Y. Levy and P. Pandurang Nayak, editors, Proceedings of the Symposium of Abstraction, Reformulation and Approximation, 1995.

Sara. In Tom Ellman and Fausto Giunchiglia, Proceedings of the Symposium of Abstraction, Reformulation and Approximation, 1998.