Switch to: Citations

Add references

You must login to add references.
  1. Planning and acting in partially observable stochastic domains.Leslie Pack Kaelbling, Michael L. Littman & Anthony R. Cassandra - 1998 - Artificial Intelligence 101 (1-2):99-134.
    Download  
     
    Export citation  
     
    Bookmark   58 citations  
  • An algorithm for probabilistic planning.Nicholas Kushmerick, Steve Hanks & Daniel S. Weld - 1995 - Artificial Intelligence 76 (1-2):239-286.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Using temporal logics to express search control knowledge for planning.Fahiem Bacchus & Froduald Kabanza - 2000 - Artificial Intelligence 116 (1-2):123-191.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • An efficient algorithm for searching implicit AND/OR graphs with cycles.P. Jiménez & C. Torras - 2000 - Artificial Intelligence 124 (1):1-30.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A logic programming approach to knowledge-state planning, II: The system.Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer & Axel Polleres - 2003 - Artificial Intelligence 144 (1-2):157-211.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Conformant planning via symbolic model checking and heuristic search.A. Cimatti, M. Roveri & P. Bertoli - 2004 - Artificial Intelligence 159 (1-2):127-206.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • 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  
  • Planning control rules for reactive agents.F. Kabanza, M. Barbeau & R. St-Denis - 1997 - Artificial Intelligence 95 (1):67-113.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • LAO∗: A heuristic search algorithm that finds solutions with loops.Eric A. Hansen & Shlomo Zilberstein - 2001 - Artificial Intelligence 129 (1-2):35-62.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.Claudio Castellini, Enrico Giunchiglia & Armando Tacchella - 2003 - Artificial Intelligence 147 (1-2):85-117.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • In defense of PDDL axioms.Sylvie Thiébaux, Jörg Hoffmann & Bernhard Nebel - 2005 - Artificial Intelligence 168 (1-2):38-69.
    Download  
     
    Export citation  
     
    Bookmark   7 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-8q2d6 uwo