Order:
  1.  4
    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.
  2.  4
    Pathology on game trees revisited, and an alternative to minimaxing.Dana S. Nau - 1983 - Artificial Intelligence 21 (1-2):221-244.
  3.  1
    On the complexity of blocks-world planning.Naresh Gupta & Dana S. Nau - 1992 - Artificial Intelligence 56 (2-3):223-254.
  4.  1
    An investigation of the causes of pathology in games.Dana S. Nau - 1982 - Artificial Intelligence 19 (3):257-278.
  5.  3
    The last player theorem.Dana S. Nau - 1982 - Artificial Intelligence 18 (1):53-65.
  6. General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.
  7.  2
    On the nature and role of modal truth criteria in planning.Subbarao Kambhampati & Dana S. Nau - 1996 - Artificial Intelligence 82 (1-2):129-155.
  8.  3
    When is it better not to look ahead?Dana S. Nau, Mitja Luštrek, Austin Parker, Ivan Bratko & Matjaž Gams - 2010 - Artificial Intelligence 174 (16-17):1323-1338.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation