Switch to: Citations

Add references

You must login to add references.
  1. The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • A probabilistic analysis of prepositional STRIPS planning.Tom Bylander - 1996 - Artificial Intelligence 81 (1-2):241-271.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Learning from planner performance.Mark Roberts & Adele Howe - 2009 - Artificial Intelligence 173 (5-6):536-561.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Complexity results for standard benchmark domains in planning.Malte Helmert - 2003 - Artificial Intelligence 143 (2):219-262.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners.Alfonso E. Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti & Yannis Dimopoulos - 2009 - Artificial Intelligence 173 (5-6):619-668.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Evaluation of a simple, scalable, parallel best-first search strategy.Akihiro Kishimoto, Alex Fukunaga & Adi Botea - 2013 - Artificial Intelligence 195 (C):222-248.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • 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-fd59bd6bd-66b8v uwo