• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 267 matches

• 2002
• 
  Ricardo Aler, Daniel Borrajo:
  On Control Knowledge Acquisition by Exploiting Human-Computer Interaction. AIPS 2002: 112-120
• 
  Greg Barish, Craig A. Knoblock:
  Speculative Execution for Information Gathering Plans. AIPS 2002: 184-193
• 
  Michael Beetz:
  Plan Representation for Robotic Agents. AIPS 2002: 223-232
• 
  Piergiorgio Bertoli, Alessandro Cimatti:
  Improving Heuristics for Planning as Search in Belief Space. AIPS 2002: 143-152
• 
  John L. Bresina, Richard Dearden, Nicolas Meuleau, David E. Smith, Richard Washington:
  Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI. AIPS Workshop on Planning for Temporal Domains 2002: 91-97
• 
  Alexandra M. Coddington:
  Handling Durative Actions in a Continuous Planning Framework. AIPS Workshop on Planning for Temporal Domains 2002: 33-40
• 
  Dirk Colbry, Bart Peintner, Martha E. Pollack:
  Execution Monitoring with Quantitative Temporal Dynamic Bayesian Networks. AIPS 2002: 194-203
• 
  Yannis Dimopoulos, Alfonso Gerevini:
  Temporal Planning through Mixed Integer Programming. AIPS Workshop on Planning for Temporal Domains 2002: 2-8
• 
  Minh Binh Do, Subbarao Kambhampati:
  Planning Graph-based Heuristics for Cost-sensitive Temporal Planning. AIPS 2002: 3-12
• 
  Minh Binh Do, Subbarao Kambhampati:
  Improving the Temporal Flexibility of Position Constrained Temporal Plans. AIPS Workshop on Planning for Temporal Domains 2002: 41-46
• 
  Carmel Domshlak, Ronen I. Brafman:
  Structure and Complexity in Planning with Unary Operators. AIPS 2002: 34-43
• 
  Stefan Edelkamp:
  Symbolic Pattern Databases in Heuristic Search Planning. AIPS 2002: 274-283
• 
  Stefan Edelkamp:
  Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System. AIPS Workshop on Planning for Temporal Domains 2002: 47-55
• 
  Maria Fox, Derek Long:
  Extending the Exploitation of Symmetries in Planning. AIPS 2002: 83-91
• 
  Maria Fox, Derek Long:
  The Third International Planning Competition: Temporal and Metric Planning. AIPS 2002: 333-
• 
  Maria Fox, Derek Long:
  Fast Temporal Planning in a Graphplan Framework. AIPS Workshop on Planning for Temporal Domains 2002: 9-17
• 
  Antonio Garrido:
  A Temporal Planning System for Level 3 Durative Actions of PDDL+. AIPS Workshop on Planning for Temporal Domains 2002: 56-66
• 
  Alfonso Gerevini, Ivan Serina:
  LPG: A Planner Based on Local Search for Planning Graphs with Action Costs. AIPS 2002: 13-22
• 
  Keith Golden, Jeremy Frank:
  Universal Quantification in a Constraint-Based Planner. AIPS 2002: 233-242
• 
  Christophe Guettier, Bertrand Allo, Vincent Legendre, Jean-Clair Poncet, Nelly Strady-Lécubin:
  Constraint Model-based Planning and Scheduling with Multiple Resources and Complex Collaboration Schema. AIPS 2002: 284-292
• 
  Malte Helmert:
  Decidability and Undecidability Results for Planning with Numerical State Variables. AIPS 2002: 44-53
• 
  Jörg Hoffmann:
  Local Search Topology in Planning Benchmarks: A Theoretical Analysis. AIPS 2002: 92-100
• 
  Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha:
  CaMeL: Learning Method Preconditions for HTN Planning. AIPS 2002: 131-142
• 
  Sven Koenig, David Furcy, Colin Bauer:
  Heuristic Search-Based Replanning. AIPS 2002: 294-301
• 
  James Kurien, P. Pandurang Nayak, David E. Smith:
  Fragment-based Conformant Planning. AIPS 2002: 153-162
• 
  Jonas Kvarnström:
  Applying Domain Analysis Techniques for Domain-Dependent Control in TALplanner. AIPS 2002: 101-111
• 
  Stephen M. Majercik, Andrew P. Rusczek:
  Faster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings. AIPS 2002: 163-172
• 
  Oded Maler:
  Timed Automata as an Underlying Model for Planning and Scheduling. AIPS Workshop on Planning for Temporal Domains 2002: 67-70
• 
  Amol Dattatraya Mali:
  Encoding Temporal Planning as CSP. AIPS Workshop on Planning for Temporal Domains 2002: 18-25
• 
  Eliseo Marzal, Eva Onaindia, Laura Sebastia:
  An Incremental Temporal Partial-Order Planner. AIPS Workshop on Planning for Temporal Domains 2002: 26-32

skipping 237 more matches