apresentada ao Centro Federal de Educa c~ ao Tecnol ogica do Paran a como requisito parcial para a obten c~ ao do grau de

[1]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Resultsfor Domain-Independent Planning: A Detailed Analysis , 1998 .

[2]  Alexander Bockmayr,et al.  Mixed Integer Programming Models for Planning Problems , 1998 .

[3]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[4]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[5]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[6]  Richard L. Tenney,et al.  The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.

[7]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[8]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[9]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[10]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[11]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[12]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[13]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[14]  Dana S. Nau,et al.  On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[15]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[16]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[17]  Jaegeol Yim,et al.  A Predicate-Transition Net Model for Multiple Agent Planning , 1991, Inf. Sci..

[18]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[19]  Jiacun Wang,et al.  Timed Petri Nets: Theory and Application , 1998 .

[20]  Marcos A. Castilho,et al.  Petriplan: A New Algorithm for Plan Generation (Preliminary Report) , 2000, IBERAMIA-SBIA.

[21]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[22]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[23]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[24]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[25]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[26]  Rodney R. Howell,et al.  The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets , 1991, Inf. Process. Lett..

[27]  Dana S. Nau,et al.  Applying integer programming to AI planning , 2000, The Knowledge Engineering Review.

[28]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..