Bibliography

AllenAllen1984

Allen, J. 1984.
Towards a general theory of action and time
Artificial Intelligence, 23, 123-154.

AllenAllen1991

Allen, J. 1991.
Planning as temporal reasoning
In Proceedings of KR-91, 3-14.

Bacchus AdyBacchus Ady2001

Bacchus, F. Ady, M. 2001.
Planning with resources and concurrency: A forward chaining approach
In Proceedings of IJCAI'01, 417-424.

Bacchus KabanzaBacchus Kabanza1998

Bacchus, F. Kabanza, F. 1998.
Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence, 22, 5-27.

Bacchus KabanzaBacchus Kabanza2000

Bacchus, F. Kabanza, F. 2000.
Using temporal logic to express search control knowledge for planning
Artificial Intelligence, 116(1-2), 123-191.

Bacchus, Tenenberg, KoomenBacchus et al.1991

Bacchus, F., Tenenberg, J., Koomen, J. 1991.
A non-reified temporal logic for AI
Artificial Intelligence, 52, 87-108.

Blum FurstBlum Furst1995

Blum, A. Furst, M. 1995.
Fast Planning through Plan-graph Analysis
In Proceedings of IJCAI-95.

Cesta OddiCesta Oddi1996

Cesta, A. Oddi, A. 1996.
Gaining efficiency and flexibility in the simple temporal problem
In Chittaro, L., Goodwin, S., Hamilton, H., Montanari, A., Proceedings of TIME'96.

ChapmanChapman1987

Chapman, D. 1987.
Planning for conjunctive goals
Artificial Intelligence, 29, 333-377.

Dechter, Meiri, PearlDechter et al.1991

Dechter, R., Meiri, I., Pearl, J. 1991.
Temporal constraint networks
Artificial Intelligence, 49.

Do KambhampatiDo Kambhampati2001

Do, M. B. Kambhampati, S. 2001.
Sapa: a domain-independent heuristic metric temporal planner
In Proceedings of ECP-01.

Drabble TateDrabble Tate1994

Drabble, B. Tate, A. 1994.
The use of optimistic and pessimistic resource profiles to inform search in an activity based planner
In Proceedings of AIPS-94. AAAI Press.

El-Kholy RichardsEl-Kholy Richards1996

El-Kholy, A. Richards, B. 1996.
Temporal and resource reasoning in planning: the ParcPlan approach
In Proceedings of ECAI'96.

Fikes NilssonFikes Nilsson1971

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

Fox LongFox Long2002

Fox, M. Long, D. 2002.
PDDL+ : Planning with time and metric resources
Department of Computer Science, 21/02, University of Durham, UK. Available at: http://www.dur.ac.uk/d.p.long/competition.html.

Galipienso SanchisGalipienso Sanchis2002

Galipienso, M. Sanchis, F. 2002.
Representation and reasoning with disjunction temporal constraints
In Proceedings of TIME'02.

Garrido, Onaindía, BarberGarrido et al.2001

Garrido, A., Onaindía, E., Barber, F. 2001.
Time-optimal planning in temporal problems
In Proceedings of ECP'01.

Gazen KnoblockGazen Knoblock1997

Gazen, B. Knoblock, C. 1997.
Combining the expressivity of UCPOP with the efficiency of Graphplan
In Proceedings of ECP-97, 221-233.

Gelfond, Lifschitz, RabinovGelfond et al.1991

Gelfond, M., Lifschitz, V., Rabinov, A. 1991.
What are the limitations of the situation calculus?
In Boyer, R., Essays in honor of Woody Bledsoe, 167-179. Kluwer Academic.

Ghallab LaruelleGhallab Laruelle1994

Ghallab, M. Laruelle, H. 1994.
Representation and control in IxTeT, a temporal planner
In Proceedings of AIPS'94.

Gupta, Henziner, JagadeesanGupta et al.1997

Gupta, V., Henziner, T., Jagadeesan, R. 1997.
Robust timed automata
In HART-97: Hybrid and Real-time Systems, LNCS 1201, 331-345. Springer-Verlag.

Haslum GeffnerHaslum Geffner2001

Haslum, P. Geffner, H. 2001.
Heuristic planning with time and resources
In Proceedings of ECP'01, Toledo.

Hayes AllenHayes Allen1987

Hayes, P. Allen, J. 1987.
Short time periods
In Proceedings of IJCAI-87, 981-983.

HelmertHelmert2002

Helmert, M. 2002.
Decidability and undecidability results for planning with numerical state variables
In Proceedings of AIPS-02.

HenzingerHenzinger1996

Henzinger, T. 1996.
The theory of hybrid automata
In Proceedings of the 11th Annual Symposium on Logic in Computer Science. Invited tutorial., 278-292. IEEE Computer Society Press.

Henzinger RaskinHenzinger Raskin2000

Henzinger, T. Raskin, J.-F. 2000.
Robust undecidability of timed and hybrid systems
In Proceedings of the 3rd International Workshop on Hybrid Systems: Computation and Control. LNCS 1790., 145-159. Springer-Verlag.

Howey LongHowey Long2002

Howey, R. Long, D. 2002.
Validating plans with continuous effects
, Dept. Computer Science, University of Durham.

Jonsson, Morris, Muscettola, RajanJonsson et al.2000

Jonsson, A., Morris, P., Muscettola, N., Rajan, K. 2000.
Planning in interplanetary space: theory and practice
In Proceedings of AIPS-00.

Kowalski SergotKowalski Sergot1986

Kowalski, R. Sergot, M. 1986.
A logic-based calculus of events
New Generation Computing, 4, 67-95.

Laborie GhallabLaborie Ghallab1995

Laborie, P. Ghallab, M. 1995.
Planning with sharable resource constraints
In Proceedings of IJCAI-95. Morgan Kaufmann.

LifschitzLifschitz1986

Lifschitz, E. 1986.
On the semantics of STRIPS
In Proceedings of 1986 Workshop: Reasoning about Actions and Plans.

Long FoxLong Fox2003a

Long, D. Fox, M. 2003a.
Exploiting a graphplan framework in temporal planning
In Proceedings of ICAPS'03.

Long FoxLong Fox2003b

Long, D. Fox, M. 2003b.
An overview and analysis of the results of the 3rd International Planning Competition
Journal of Artifical Intelligence Research, this issue.

McAllester RosenblittMcAllester Rosenblitt1991

McAllester, D. Rosenblitt, D. 1991.
Systematic nonlinear planning
In Proceedings of AAAI'91,  2, 634-639, Anaheim, California, USA. AAAI Press/MIT Press.

McCarthyMcCarthy1980

McCarthy, J. 1980.
Circumscription -- a form of non-monotonic reasoning
Artificial Intelligence, 13, 27-39.

McCarthy HayesMcCarthy Hayes1969

McCarthy, J. Hayes, P. 1969.
Some philosophical problems from the standpoint of artificial intelligence
In Meltzer, B. Michie, D., Machine Intelligence 4, 463-502. Edinburgh University Press.

McDermottMcDermott1982

McDermott, D. 1982.
A temporal logic for reasoning about processes and plans
Cognitive Science, 6, 101-155.

McDermottMcDermott2000

McDermott, D. 2000.
The 1998 AI planning systems competition
AI Magazine, 21(2).

McDermottMcDermott2003

McDermott, D. 2003.
Reasoning about autonomous processes in an estimated-regression planner
In Proceedings of ICAPS-03.

McDermott the AIPS-98 Planning Competition CommitteeMcDermott the AIPS-98 Planning Competition Committee1998

McDermott, D. the AIPS-98 Planning Competition Committee 1998.
PDDL-the planning domain definition language
, Available at: www.cs.yale.edu/homes/dvm.

MuscettolaMuscettola1994

Muscettola, N. 1994.
HSTS: Integrating planning and scheduling
In Zweben, M. Fox, M., Intelligent Scheduling, 169-212. Morgan Kaufmann, San Mateo, CA.

Nau, Cao, Lotem, Muñoz-AvilaNau et al.1999

Nau, D., Cao, Y., Lotem, A., Muñoz-Avila, H. 1999.
SHOP: Simple hierarchical ordered planner
In Proceedings of IJCAI'99.

PednaultPednault1986

Pednault, E. 1986.
Formulating multiagent, dynamic-world problems in the classical planning framework
In Georgeff, M. Lansky, A., Proceedings of the Timberline Oregon Workshop on Reasoning about Actions and Plans.

PednaultPednault1989

Pednault, E. 1989.
ADL: Exploring the middle ground between STRIPS and the situation calculus
In Proceedings of KR-89, 324-332.

Penberthy WeldPenberthy Weld1994

Penberthy, J. Weld, D. 1994.
Temporal planning with continuous change
In Proceedings of AAAI-94. AAAI/MIT Press.

Penberthy WeldPenberthy Weld1992

Penberthy, J. Weld, D. 1992.
UCPOP: a sound, complete, partial-order planner for ADL
In Proceedings of KR'92, 103-114, Los Altos, CA. Kaufmann.

Rabideau, Knight, Chien, Fukunaga, GovindjeeRabideau et al.1999

Rabideau, G., Knight, R., Chien, S., Fukunaga, A., Govindjee, A. 1999.
Iterative repair planning for spacecraft operations in the ASPEN system
In International Symposium on Artificial Intelligence Robotics and Automation in Space (i-SAIRAS).

ReichgeltReichgelt1989

Reichgelt, H. 1989.
A comparison of first order and modal theories of time
In Jackson, P., Reichgelt, H., van Harmelen, F., Logic-based knowledge representation, 143-176. MIT Press.

ReiterReiter1980

Reiter, R. 1980.
A logic for default reasoning
Artificial Intelligence, 13, 81-132.

Russell NorvigRussell Norvig1995

Russell, S. Norvig, P. 1995.
Artificial Intelligence: a Modern Approach.
Prentice Hall.

SandewallSandewall1994

Sandewall, E. 1994.
Features and fluents: the representation of knowledge about dynamical systems, volume I.
Oxford University Press.

ShanahanShanahan1990

Shanahan, M. 1990.
Representing continuous change in the event calculus
In Proceedings of ECAI'90, 598-603.

ShanahanShanahan1999

Shanahan, M. 1999.
The event calculus explained
In Wooldridge, M. Veloso, M., Artificial Intelligence Today, 409-430. Springer Lecture Notes in Artificial Intelligence no. 1600.

ShohamShoham1985

Shoham, Y. 1985.
Ten requirements for a theory of change
New Generation Computing, 3, 467-477.

Smith WeldSmith Weld1999

Smith, D. Weld, D. 1999.
Temporal planning with mutual exclusion reasoning
In Proceedings of IJCAI-99, Stockholm, 326-337.

TateTate1977

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

van Benthamvan Bentham1983

van Bentham, J. 1983.
The logic of time.
Kluwer Academic Press, Dordrecht.

VereVere1983

Vere, S. 1983.
Planning in time: Windows and durations for activities and goals
IEEE Transactions on Pattern Analysis and Machine Intelligence, 5.

VilaVila1994

Vila, L. 1994.
A survey on temporal reasoning in artificial intelligence
AI Communications, 7, 4-28.

WilkinsWilkins1988

Wilkins, D. 1988.
Practical Planning: Extending the Classical AI Planning Paradigm.
Morgan Kaufmann Publishers Inc., San Francisco, CA.