Switch to: Citations

Add references

You must login to add references.
  1. On the undecidability of probabilistic planning and related stochastic optimization problems.Omid Madani, Steve Hanks & Anne Condon - 2003 - Artificial Intelligence 147 (1-2):5-34.
    Download  
     
    Export citation  
     
    Bookmark   7 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  
  • Decidability and complexity of action-based temporal planning over dense time.Nicola Gigante, Andrea Micheli, Angelo Montanari & Enrico Scala - 2022 - Artificial Intelligence 307 (C):103686.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Weak, strong, and strong cyclic planning via symbolic model checking.A. Cimatti, M. Pistore, M. Roveri & P. Traverso - 2003 - Artificial Intelligence 147 (1-2):35-84.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Processes and continuous change in a SAT-based planner.Ji-Ae Shin & Ernest Davis - 2005 - Artificial Intelligence 166 (1-2):194-253.
    Download  
     
    Export citation  
     
    Bookmark   2 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-7674574dd6-42nkg uwo