5. ECP 1999: Durham, UK

@proceedings{DBLP:conf/ecp/1999,
  editor    = {Susanne Biundo and
               Maria Fox},
  title     = {Recent Advances in AI Planning, 5th European Conference on Planning,
               ECP'99, Durham, UK, September  8-10, 1999, Proceedings},
  booktitle = {ECP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1809},
  year      = {2000},
  isbn      = {3-540-67866-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Fausto Giunchiglia, Paolo Traverso: Planning as Model Checking. 1-20
• Alessandro Cimatti, Marco Roveri: Conformant Planning via Model Checking. 21-34
• Marco Daniele, Paolo Traverso, Moshe Y. Vardi: Strong Cyclic Planning Revisited. 35-48
• Vassilis Liatsos, Barry Richards: Scaleability in Planning. 49-61
• Adele E. Howe, Eric Dahlman, Christoper Hansen, Michael Scheetz, Anneliese von Mayrhauser: Exploiting Competitive Planner Performance. 62-72
• Larry D. Pyeatt, Adele E. Howe: A Parallel Algorithm for POMDP Solution. 73-83
• Amol Dattatraya Mali: Plan Merging & Plan Reuse as Satisfiability. 84-96
• Alessandro Armando, Claudio Castellini, Enrico Giunchiglia: SAT-Based Procedures for Temporal Reasoning. 97-108
• Jussi Rintanen, Hartmut Jungholt: Numeric State Variables in Constraint-Based Planning. 109-121
• Amol Dattatraya Mali: Hierarchical Task Network Planning as Satisfiability. 122-134
• Stefan Edelkamp, Malte Helmert: Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. 135-147
• Ulrich Scholz: Action Constraints for Planning. 148-158
• Rosy Barruffi, Evelina Lamma, Paola Mello, Michela Milano: Least Commitment on Variable Binding in Presence of Incomplete Knowledge. 159-171
• Biplav Srivastava, Subbarao Kambhampati: Scaling up Planning by Teasing out Resource Scheduling. 172-186
• Yong Wang, Qiang Yang, Zhong Zhang: Real-Time Scheduling for Multi-agent Call Center Automation. 187-199
• Brian Drabble: Task Decomposition Support to Reactive Scheduling. 200-212
• Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem. 213-225
• Giuseppe De Giacomo, Moshe Y. Vardi: Automata-Theoretic Approach to Planning for Temporally Extended Goals. 226-238
• Alexander Bockmayr, Yannis Dimopoulos: Integer Programs and Valid Inequalities for Planning Problems. 239-251
• Stephen Cresswell, Alan Smaill, Julian Richardson: Deductive Synthesis of Recursive Plans in Linear Logic. 252-264
• Sven Koenig, Yaxin Liu: Sensor Planning with Non-linear Utility Functions. 265-277
• Olivier Despouys, François Felix Ingrand: Propice-Plan: Toward a Unified Framework for Planning and Execution. 278-293
• Bernhard Nebel: What Is the Expressive Power of Disjunctive Preconditions? 294-307
• Patrik Haslum, Peter Jonsson: Some Results on the Complexity of Planning with Incomplete Information. 308-318
• Avrim Blum, John Langford: Probabilistic Planning in the Graphplan Framework. 319-332
• Eric Parker: Making Graphplan Goal-Directed. 333-346
• Ioannis Refanidis, Ioannis P. Vlahavas: GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables. 347-359
• Blai Bonet, Hector Geffner: Planning as Heuristic Search: New Results. 360-372