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  
  • Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
    Download  
     
    Export citation  
     
    Bookmark   40 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  
  • State-variable planning under structural restrictions: algorithms and complexity.Peter Jonsson & Christer Bäckström - 1998 - Artificial Intelligence 100 (1-2):125-176.
    Download  
     
    Export citation  
     
    Bookmark   4 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-6f9648bdd6-6d7m4 uwo