Switch to: Citations

Add references

You must login to add references.
  1. Branching and pruning: An optimal temporal POCL planner based on constraint programming.Vincent Vidal & Héctor Geffner - 2006 - Artificial Intelligence 170 (3):298-335.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.
    Download  
     
    Export citation  
     
    Bookmark   219 citations  
  • Complexity results for standard benchmark domains in planning.Malte Helmert - 2003 - Artificial Intelligence 143 (2):219-262.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Concise finite-domain representations for PDDL planning tasks.Malte Helmert - 2009 - Artificial Intelligence 173 (5-6):503-535.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
    Download  
     
    Export citation  
     
    Bookmark   120 citations  
  • The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP.Minh Binh Do & Subbarao Kambhampati - 2001 - Artificial Intelligence 132 (2):151-182.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Fixed-parameter complexity in AI and nonmonotonic reasoning.Georg Gottlob, Francesco Scarcello & Martha Sideri - 2002 - Artificial Intelligence 138 (1-2):55-86.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f97f49787-df84k uwo