Bibliography

1

Emile Aarts and Jan Karel Lenstra.
Local Search in Combinatorial Optimization.
John Wiley and Sons, Chichester, England, 1997.

2

Serge Abiteboul, Richard Hull, and Victor Vianu.
Foundations of Databases.
Addison-Wesley, 1995.

3

José Luis Ambite.
Planning by Rewriting.
PhD thesis, University of Southern California, 1998.

4

José Luis Ambite and Craig A. Knoblock.
Planning by rewriting: Efficiently generating high-quality plans.
In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 706-713, Providence, RI, 1997.

5

José Luis Ambite and Craig A. Knoblock.
Flexible and scalable cost-based query planning in mediators: A transformational approach.
Artificial Intelligence, 118(1-2):115-161, April 2000.

6

José Luis Ambite, Craig A. Knoblock, and Steven Minton.
Learning plan rewriting rules.
In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems, Breckenridge, CO, 2000.

7

Naveen Ashish, Craig A. Knoblock, and Alon Levy.
Information gathering plans with sensing actions.
In Sam Steel and Rachid Alami, editors, Recent Advances in AI Planning: 4th European Conference on Planning, ECP'97. Springer-Verlag, New York, 1997.

8

Juergen Avenhaus and Klaus Madlener.
Term rewriting and equational reasoning.
In Formal Techniques in Artificial Intelligence, pages 1-43. Elsevier, North Holland, 1990.

9

Franz Baader and Tobias Nipkow.
Term Rewriting and All That.
Cambridge University Press, 1998.

10

Fahiem Bacchus and Froduald Kabanza.
Using temporal logic to control search in a forward chaining planner.
In Proceedings of the 3rd European Workshop on Planning, 1995.

11

Fahiem Bacchus and Froduald Kabanza.
Using temporal logics to express search control knowledge for planning.
Artificial Intelligence, 116(1-2):123-191, 2000.

12

Christer Bäckström.
Executing parallel plans faster by adding actions.
In A. G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence, pages 615-619, Amsterdam, Netherlands, August 1994. John Wiley and Sons.

13

Christer Bäckström.
Finding least constrained plans and optimal parallel executions is harder that we thought.
In C. Bäckström and E. Sandewell, editors, Current Trends in AI Planning: Proceedings of the 2nd European Workshop on Planning (EWSP-93), pages 46-59, Vadstena, Sweeden, December 1994. IOS Press (Amsterdam).

14

Christer Bäckström and Bernhard Nebel.
Complexity results for SAS$^+$ planning.
Computational Intelligence, 11(4):625-655, 1995.

15

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

16

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

17

Blai Bonet and Héctor Geffner.
Planning as heuristic search: New results.
In Proceedings of the Fifth European Conference on Planning (ECP-99), Durham, UK, 1999.

18

Blai Bonet, Gábor Loerincs, and Héctor Geffner.
A robust and fast action selection mechanism for planning.
In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 714-719, Providence, RI, 1997.

19

Daniel Borrajo and Manuela Veloso.
Lazy incremental learning of control knowledge for efficiently obtaining quality plans.
AI Review, 11:371-405, 1997.

20

Tom Bylander.
The computation complexity of propositional strips.
Artificial Intelligence, 69(1-2):165-204, 1994.

21

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, Hillsdale, NJ, 1991.

22

Mitch Cherniack and Stanley B. Zdonik.
Rule languages and internal algebras for rule-based optimizers.
SIGMOD Record (ACM Special Interest Group on Management of Data), 25(2):401-412, June 1996.

23

Mitch Cherniack and Stanley B. Zdonik.
Changing the rules: Transformations for rule-based optimizers.
In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 61-72, Seattle, WA, 1998.

24

Tom Dean and Mark Boddy.
An analysis of time-dependent planning.
In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 49-54, Saint Paul, MN, 1988.

25

Heiko Dorr.
Efficient graph rewriting and its implementation, volume 922 of Lecture Notes in Computer Science.
Springer-Verlag Inc., New York, NY, USA, 1995.

26

Kutluhan Erol, Dana Nau, and James Hendler.
UMCP: A sound and complete planning procedure for hierarchical task-network planning.
In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pages 249-254, Chicago, IL, 1994.

27

Kutluhan Erol, Dana Nau, and V. S. Subrahmanian.
Decidability and undecidability results for domain-independent planning.
Artificial Intelligence, 76(1-2):75-88, 1995.

28

Tara A. Estlin and Raymond J. Mooney.
Learning to improve both efficiency and quality of planning.
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 1227-1233, Nagoya, Japan, 1997.

29

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

30

Oren Etzioni and Daniel S. Weld.
A softbot-based interface to the Internet.
Communications of the ACM, 37(7), 1994.

31

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

32

Charles L. Forgy.
Rete: A fast algorithm for the many pattern/many object pattern match problem.
Artificial Intelligence, 19:17-37, 1982.

33

David E. Foulser, Ming Li, and Qiang Yang.
Theory and algorithms for plan merging.
Artificial Intelligence, 57(2-3):143-182, 1992.

34

Maria Fox and Derek Long.
The automatic inference of state invariants in TIM.
Journal of Artificicial Intelligence Research, 9:367-421, 1998.

35

Alfonso Gerevini and Lenhart Schubert.
Inferring state constraints for domain-independent planning.
In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 905-912, Madison, WI, 1998.

36

Fred Glover.
Tabu search-Part I.
ORSA Journal on Computing, 1(3):190-206, 1989.

37

Carla P. Gomes, Bart Selman, and Henry Kautz.
Boosting combinatorial search through randomization.
In Proceedings of the Fifteenth National Conference on Artificial Intelligence, Madison, WI, 1998.

38

Naresh Gupta and Dana S. Nau.
On the complexity of blocks-world planning.
Artificial Intelligence, 56(2-3):223-254, 1992.

39

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

40

David S. Johnson.
Local optimization and the traveling salesman problem.
In M. S. Paterson, editor, Automata, Languages and Programming: Proc. of the 17th International Colloquium, pages 446-461. Springer, New York, 1990.

41

Subbarao Kambhampati.
A validation-structure-based theory of plan modification and reuse.
Artificial Intelligence, 55(2-3):193-258, 1992.

42

Subbarao Kambhampati, Craig A. Knoblock, and Qiang Yang.
Planning as refinement search: A unified framework for evaluating the design tradeoffs in partial order planning.
Artificial Intelligence, 76(1-2):167-238, 1995.

43

H. Kautz and B. Selman.
Planning as satisfiability.
In Bernd Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 359-363, Vienna, Austria, August 1992. John Wiley & Sons.

44

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

45

Scott Kirkpatrick, C. D. Gelatt, and Mario P. Vecchi.
Optimization by simulated annealing.
Science, 220:671-680, May 1983.

46

Craig A. Knoblock.
Automatically generating abstractions for planning.
Artificial Intelligence, 68(2):243-302, 1994.

47

Craig A. Knoblock.
Generating parallel execution plans with a partial-order planner.
In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, Chicago, IL, 1994.

48

Craig A. Knoblock.
Planning, executing, sensing, and replanning for information gathering.
In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, Canada, 1995.

49

Craig A. Knoblock.
Building a planner for information gathering: A report from the trenches.
In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, Edinburgh, Scotland, 1996.

50

Jana Koehler.
Solving complex planning tasks through extraction of subproblems.
In Reid Simmons, Manuela Veloso, and Stephen Smith, editors, Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, pages 62-69, Pittsburgh, PA, June7 -10  1998.

51

Jana Koehler and Jorg Hoffmann.
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm.
Journal of Artificial Intelligence Research, 12:338-386, 2000.

52

Jana Koehler, Bernard Nebel, Jörg Hoffman, and Yannis Dimopoulos.
Extending planning graphs to an ADL subset.
In Sam Steel and Rachid Alami, editors, Proceedings of the Fourth European Conference on Planning (ECP-97): Recent Advances in AI Planning, volume 1348 of LNAI, pages 273-285, Berlin, September24  -26  1997. Springer.

53

David McAllester and David Rosenblitt.
Systematic nonlinear planning.
In Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, 1991.

54

Steven Minton.
Learning Effective Search Control Knowledge: An Explanation-Based Approach.
PhD thesis, Computer Science Department, Carnegie Mellon University, 1988.

55

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

56

Steven Minton.
Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems.
Artificial Intelligence, 58(1-3):161-205, 1992.

57

Steven Minton.
Automatically configuring constraint satisfaction programs: A case study.
Constraints, 1(1):7-43, 1996.

58

Steven Minton, Mark D. Johnston, Andrew B. Philips, and Philip Laird.
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method.
In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 17-24, Boston, MA, 1990.

59

Hector Muñoz-Avila.
Integrating Twofold Case Retrieval and Complete Decision Replay in CAPlan/CbC.
PhD thesis, University of Kaiserslautern, 1998.

60

Dana S. Nau, Satyandra K. Gupta, and William C. Regli.
AI planning versus manufacturing-operation planning: A case study.
In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal, Canada, 1995.

61

Bernhard Nebel and Jana Koehler.
Plan reuse versus plan generation: A theoretical and empirical analysis.
Artificial Intelligence, 76((1-2)):427-454, 1995.

62

Kiyoshi Ono and Guy M. Lohman.
Measuring the complexity of join enumeration in query optimization.
In Dennis McLeod, Ron Sacks-Davis, and Hans-Jörg Schek, editors, 16th International Conference on Very Large Data Bases, pages 314-325, Brisbane, Queensland, Australia, 13-16 August 1990. Morgan Kaufmann.

63

Christos H. Papadimitriou and Kenneth Steiglitz.
On the complexity of local search for the traveling salesman problem.
SIAM, 6(1):76-83, March 1977.

64

Christos H. Papadimitriou and Kenneth Steiglitz.
Combinatorial Optimization: Algorithms and Complexity.
Prentice Hall, Englewood Cliffs, NJ, 1982.

65

J. Scott Penberthy and Daniel S. Weld.
UCPOP: A sound, complete, partial order planner for ADL.
In Third International Conference on Principles of Knowledge Representation and Reasoning, pages 189-197, Cambridge, MA, 1992.

66

M. Alicia Pérez.
Representing and learning quality-improving search control knowledge.
In Proceedings of the Thirteenth International Conference on Machine Learning, Bari, Italy, 1996.

67

Daniel Ratner and Ira Pohl.
Joint and LPA*: Combination of approximation and search.
In Proceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, PA, 1986.

68

Jussi Rintanen.
An iterative algorithm for synthesizing invariants.
In Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, TX, 2000.

69

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

70

Earl D. Sacerdoti.
The nonlinear nature of plans.
In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, pages 206-214, Tbilisi, Georgia, USSR, 1975.

71

Sam Savage, Peter Weiner, and A. Bagchi.
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient.
Journal of Computer and System Sciences, 12(1):25-35, February 1976.

72

Andy Schürr.
Introduction to PROGRES, an attribute graph grammar based specification language.
In M. Nagl, editor, Graph-Theoretic Concepts in Computer Science, volume 411 of Lecture Notes in Computer Science, pages 151-165, 1990.

73

Andy Schürr.
Programmed graph replacement systems.
In Grzegorz Rozenberg, editor, Handbook on Graph Grammars: Foundations, volume 1, pages 479-546. World Scientific, Singapore, 1997.

74

Timos K. Sellis.
Multiple-query optimization.
ACM Transactions on Database Systems, 13(1):23-52, March 1988.

75

Bart Selman, Hector Levesque, and David Mitchell.
A new method for solving hard satisfiability problems.
In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pages 440-446, San Jose, California, July 1992. AAAI Press.

76

Abraham Silberschatz, Henry F. Korth, and S. Sudarshan.
Database System Concepts.
McGraw-Hill, third edition, 1997.

77

Herbert Simon.
The sciences of the artificial.
MIT Press, 1969.

78

John Slaney and Sylvie Thiébaux.
Linear time near-optimal planning in the blocks world.
In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 1208-1214, Menlo Park, August 1996. AAAI Press / MIT Press.

79

Gerald J. Sussman.
A Computer Model of Skill Acquisition.
American Elsevier, New York, 1975.

80

Manuela Veloso.
Planning and Learning by Analogical Reasoning.
Springer Verlag, December 1994.

81

Manuela M. Veloso, M. Alicia Perez, and Jaime G. Carbonell.
Nonlinear planning with parallel resource allocation.
In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control, pages 207-212, San Diego, CA, 1990.

82

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

83

Daniel S. Weld.
Recent advances in AI planning.
AI Magazine, 20(2), 1999.

84

C.T. Yu and C.C. Chang.
Distributed query processing.
ACM Computing Surveys, 16(4):399-433, 1984.

85

Monte Zweben, Brian Daun, and Michael Deale.
Scheduling and rescheduling with iterative repair.
In Intelligent Scheduling, pages 241-255. Morgan Kaufman, San Mateo, CA, 1994.