The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dana S. Nau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kyuseok Shim, Timos K. Sellis, Dana S. Nau
    Improvements on a Heuristic Algorithm for Multiple-Query Optimization. [Citation Graph (5, 0)][DBLP]
    Data Knowl. Eng., 1994, v:12, n:2, pp:197-222 [Journal]
  2. Dana S. Nau, James A. Reggia
    Relationships Between Deductive and Abductive Inference in Knowledge-Based Diagnostic Problem Solving. [Citation Graph (1, 0)][DBLP]
    Expert Database Workshop, 1984, pp:549-558 [Conf]
  3. Dana S. Nau, Vipin Kumar, Laveen N. Kanal
    General Branch and Bound, and its Relation to A and AO. [Citation Graph (1, 0)][DBLP]
    Artif. Intell., 1984, v:23, n:1, pp:29-58 [Journal]
  4. V. S. Subrahmanian, Dana S. Nau, Carlo Vago
    WFS + Branch and Bound = Stable Models. [Citation Graph (1, 16)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1995, v:7, n:3, pp:362-377 [Journal]
  5. Tsz-Chiu Au, Dana S. Nau
    Maintaining Cooperation in Noisy Environments. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  6. Ping-Ching Chi, Dana S. Nau
    Comparing Minimax and Product in a Variety of Games. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:100-104 [Conf]
  7. Kutluhan Erol, James A. Hendler, Dana S. Nau
    HTN Planning: Complexity and Expressivity. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1123-1128 [Conf]
  8. Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
    On the Complexity of Domain-Independent Planning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:381-386 [Conf]
  9. Subrata Ghosh, Ambuj Mahanti, Dana S. Nau
    ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1353-1358 [Conf]
  10. Naresh Gupta, Dana S. Nau
    Complexity Results for Blocks-World Planning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:629-633 [Conf]
  11. Subbarao Kambhampati, Dana S. Nau
    On the Nature of Modal Truth Criteria in Planning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1055-1060 [Conf]
  12. Ugur Kuter, Dana S. Nau
    Forward-Chaining Planning in Nondeterministic Domains. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:513-518 [Conf]
  13. Ugur Kuter, Dana S. Nau
    Using Domain-Configurable Search Control for Probabilistic Planning. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1169-1174 [Conf]
  14. Ugur Kuter, Dana S. Nau
    Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  15. Dana S. Nau
    Pathology on Game Trees: A Summary of Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 1980, pp:102-104 [Conf]
  16. Amnon Lotem, Dana S. Nau, James A. Hendler
    Using Planning Graphs for Solving HTN Planning Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1999, pp:534-540 [Conf]
  17. Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal
    Performance of IDA on Trees and Graphs. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:539-544 [Conf]
  18. Dana S. Nau, Vipin Kumar, Laveen N. Kanal
    A General Paradigm for A.I. Search Procedures. [Citation Graph (0, 0)][DBLP]
    AAAI, 1982, pp:120-123 [Conf]
  19. Dana S. Nau, Stephen J. J. Smith, Kutluhan Erol
    Control Strategies in HTN Planning: Theory Versus Practice. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:1127-1133 [Conf]
  20. Héctor Muñoz-Avila, David W. Aha, Len Breslow, Dana S. Nau
    HICAP: An Interactive Case-Based Planning Architecture and its Application to Noncombatant Evacuation Operations. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1999, pp:870-875 [Conf]
  21. Austin Parker, Dana S. Nau, V. S. Subrahmanian
    Overconfidence or Paranoia? Search in Imperfect-Information Games. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  22. James A. Reggia, Dana S. Nau, Pearl Y. Wang
    A New Inference Method for Frame-Based Expert Systems. [Citation Graph (0, 0)][DBLP]
    AAAI, 1983, pp:333-337 [Conf]
  23. Stephen J. J. Smith, Dana S. Nau
    An Analysis of Forward Pruning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1386-1391 [Conf]
  24. Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
    Total-Order Multi-Agent Task-Network Planning for Contract Bridge. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:108-113 [Conf]
  25. Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
    Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:1079-1086 [Conf]
  26. Reiko Tsuneto, Kutluhan Erol, James A. Hendler, Dana S. Nau
    Commitment Strategies in Hierarchical Task Network Planning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:536-542 [Conf]
  27. Reiko Tsuneto, James A. Hendler, Dana S. Nau
    Analyzing External Conditions to Improve the Efficiency of HTN Planning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:913-920 [Conf]
  28. Kutluhan Erol, James A. Hendler, Dana S. Nau
    UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning. [Citation Graph (0, 0)][DBLP]
    AIPS, 1994, pp:249-254 [Conf]
  29. Amnon Lotem, Dana S. Nau
    New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains. [Citation Graph (0, 0)][DBLP]
    AIPS, 2000, pp:206-215 [Conf]
  30. Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso
    A Hierarchical Task-Network Planner based on Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:300-309 [Conf]
  31. Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha
    CaMeL: Learning Method Preconditions for HTN Planning. [Citation Graph (0, 0)][DBLP]
    AIPS, 2002, pp:131-142 [Conf]
  32. Fusun Yaman, Dana S. Nau
    Timeline: An HTN Planner that can Reason about Time. [Citation Graph (0, 0)][DBLP]
    AIPS Workshop on Planning for Temporal Domains, 2002, pp:75-81 [Conf]
  33. Tsz-Chiu Au, Dana S. Nau
    Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma). [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:561-568 [Conf]
  34. Jürgen Dix, Héctor Muñoz-Avila, Dana S. Nau, Lingling Zhang
    Planning in a multi-agent environment: theory and practice. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:944-945 [Conf]
  35. Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. Subrahmanian
    A stochastic language for modelling opponent agents. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:244-246 [Conf]
  36. Jürgen Dix, Ugur Kuter, Dana S. Nau
    Planning in Answer Set Programming using Ordered Task Decomposition. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:521-576 [Conf]
  37. Jürgen Dix, Héctor Muñoz-Avila, Dana S. Nau
    IMPACTing SHOP: Planning in a Multi-agent Environment. [Citation Graph (0, 0)][DBLP]
    CL-2000 Workshop on Computational Logic in Multi-Agent Systems, 2000, pp:44-55 [Conf]
  38. Tsz-Chiu Au, Dana S. Nau
    The Incompleteness of Planning with Volatile External Information. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:839-840 [Conf]
  39. Tsz-Chiu Au, Dana S. Nau, V. S. Subrahmanian
    Utilizing Volatile External Information During Planning. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:647-651 [Conf]
  40. Reiko Tsuneto, Dana S. Nau, James A. Hendler
    Plan-Refinement Strategies and Search-Space Size. [Citation Graph (0, 0)][DBLP]
    ECP, 1997, pp:414-426 [Conf]
  41. Tsz-Chiu Au, Héctor Muñoz-Avila, Dana S. Nau
    On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework. [Citation Graph (0, 0)][DBLP]
    ECCBR, 2002, pp:13-27 [Conf]
  42. Héctor Muñoz-Avila, David W. Aha, Len Breslow, Dana S. Nau, Rosina Weber-Lee
    Integrating Conversational Case Retrieval with generative Planning. [Citation Graph (0, 0)][DBLP]
    EWCBR, 2000, pp:210-221 [Conf]
  43. Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa Sapino, V. S. Subrahmanian
    Plan Databases: Model and Algebra. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2004, pp:302-320 [Conf]
  44. Héctor Muñoz-Avila, Daniel C. McFarlane, David W. Aha, Len Breslow, James A. Ballas, Dana S. Nau
    Using Guidelines to Constrain Interactive Case-Based HTN Planning. [Citation Graph (0, 0)][DBLP]
    ICCBR, 1999, pp:288-302 [Conf]
  45. Okhtay Ilghami, Héctor Muñoz-Avila, Dana S. Nau, David W. Aha
    Learning approximate preconditions for methods in hierarchical plans. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:337-344 [Conf]
  46. Kutluhan Erol, James A. Hendler, Dana S. Nau, Reiko Tsuneto
    A Critical Look at Critics in HTN Planning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1592-1598 [Conf]
  47. Raghu Karinthi, Dana S. Nau
    Using a Feature Algebra for Reasoning about Geometric Feature Interactions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:1219-1224 [Conf]
  48. Héctor Muñoz-Avila, David W. Aha, Dana S. Nau, Rosina Weber, Len Breslow, Fusun Yaman
    SiN: Integrating Case-based Reasoning with Task Decomposition. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:999-1004 [Conf]
  49. Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila
    SHOP: Simple Hierarchical Ordered Planner. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:968-975 [Conf]
  50. Dana S. Nau, Satyandra K. Gupta, William C. Regli
    AI Planning Versus Manufacturing-Operation Planning: A Case Study. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1670-1676 [Conf]
  51. Dana S. Nau, Héctor Muñoz-Avila, Yue Cao, Amnon Lotem, Steven Mitchell
    Total-Order Planning with Partially Ordered Subtasks. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:425-430 [Conf]
  52. Austin Parker, Dana S. Nau, V. S. Subrahmanian
    Game-Tree Search with Combinatorially Large Belief States. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:254-259 [Conf]
  53. Thomas Vossen, Michael Ball, Amnon Lotem, Dana S. Nau
    On the Use of Integer Programming Models in AI Planning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:304-309 [Conf]
  54. Qiang Yang, Dana S. Nau
    Preprocessing Search Spaces for Branch and Bound Search. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:349-353 [Conf]
  55. Fusun Yaman, Dana S. Nau, V. S. Subrahmanian
    Going Far, Logically. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:615-620 [Conf]
  56. Fusun Yaman, Dana S. Nau, V. S. Subrahmanian
    A Motion Closed World Asumption. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:621-626 [Conf]
  57. Austin Parker, Fusun Yaman, Dana S. Nau, V. S. Subrahmanian
    Probabilistic Go Theories. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:501-506 [Conf]
  58. Jürgen Dix, Héctor Muñoz-Avila, Dana S. Nau, Lingling Zhang
    Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:173-185 [Conf]
  59. Jürgen Dix, Ugur Kuter, Dana S. Nau
    Planning in Answer Set Programming Using Ordered Task Decomposition. [Citation Graph (0, 0)][DBLP]
    KI, 2003, pp:490-504 [Conf]
  60. Dana S. Nau, Michael Ball, John S. Baras, Abdur Chowdhury, Edward Lin, Jeff Meyer, Ravi Rajamani, John Splain, Vinai Trichur
    Integrated Product and Process Design of Microwave Modules using AI Planning and Integer Programming. [Citation Graph (0, 0)][DBLP]
    Knowledge Intensive CAD, 2000, pp:147-158 [Conf]
  61. Mihai Ciocoiu, Dana S. Nau
    Ontology-Based Semantics. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:539-546 [Conf]
  62. Fusun Yaman, Dana S. Nau, V. S. Subrahmanian
    A Logic of Motion. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:85-94 [Conf]
  63. James A. Reggia, Dana S. Nau
    An Abductive Non-Monotonic Logic. [Citation Graph (0, 0)][DBLP]
    NMR, 1984, pp:385-395 [Conf]
  64. Tsz-Chiu Au, Ugur Kuter, Dana S. Nau
    Web Service Composition with Volatile Information. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2005, pp:52-66 [Conf]
  65. Ugur Kuter, Evren Sirin, Dana S. Nau, Bijan Parsia, James A. Hendler
    Information Gathering During Planning for Web Service Composition. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2004, pp:335-349 [Conf]
  66. Dan Wu, Bijan Parsia, Evren Sirin, James A. Hendler, Dana S. Nau
    Automating DAML-S Web Services Composition Using SHOP2. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2003, pp:195-210 [Conf]
  67. Alexei Elinson, Dana S. Nau, William C. Regli
    Feature-Based Similarity Assessment of Solid Models. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 1997, pp:297-310 [Conf]
  68. Satyandra K. Gupta, Dana S. Nau
    Generation of alternative feature-based models and precedence orderings for machining applications. [Citation Graph (0, 0)][DBLP]
    Solid Modeling and Applications, 1993, pp:465-466 [Conf]
  69. Satyandra K. Gupta, William C. Regli, Dana S. Nau
    Manufacturing feature instances: which ones to recognize?. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 1995, pp:141-152 [Conf]
  70. William C. Regli, Dana S. Nau
    Building a general approach to feature recognition of Material Removal. [Citation Graph (0, 0)][DBLP]
    Solid Modeling and Applications, 1993, pp:293-302 [Conf]
  71. Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau
    A geometric algorithm for selecting optimal set of cutters for multi-part milling. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2001, pp:130-139 [Conf]
  72. Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng
    An Evaluation of Two Alternatives to Minimax. [Citation Graph (0, 0)][DBLP]
    UAI, 1985, pp:505-509 [Conf]
  73. Dan Wu, Evren Sirin, James A. Hendler, Dana S. Nau, Bijan Parsia
    Automatic Web Services Composition Using SHOP2. [Citation Graph (0, 0)][DBLP]
    WWW (Posters), 2003, pp:- [Conf]
  74. Raghu Karinthi, Dana S. Nau, Qiang Yang
    Handling feature interactions in process-planning. [Citation Graph (0, 0)][DBLP]
    Applied Artificial Intelligence, 1992, v:6, n:4, pp:389-415 [Journal]
  75. Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
    Complexity, Decidability and Undecidability Results for Domain-Independent Planning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:76, n:1-2, pp:75-88 [Journal]
  76. Naresh Gupta, Dana S. Nau
    On the Complexity of Blocks-World Planning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:56, n:2-3, pp:223-254 [Journal]
  77. Subbarao Kambhampati, Dana S. Nau
    On the Nature and Role of Modal Truth Criteria in Planning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:82, n:1-2, pp:129-155 [Journal]
  78. Dana S. Nau
    Pathology on Game Trees Revisited, and an Alternative to Minimaxing. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1983, v:21, n:1-2, pp:221-244 [Journal]
  79. Dana S. Nau
    An Investigation of the Causes of Pathology in Games. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1982, v:19, n:3, pp:257-278 [Journal]
  80. Dana S. Nau
    The Last Player Theorem. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1982, v:18, n:1, pp:53-65 [Journal]
  81. Dana S. Nau, Michael Ball, John S. Baras, Abdur Chowdhury, Edward Lin, Jeff Meyer, Ravi Rajamani, John Splain, Vinai Trichur
    Generating and evaluating designs and plans for microwave modules. [Citation Graph (0, 0)][DBLP]
    AI EDAM, 2000, v:14, n:4, pp:289-304 [Journal]
  82. Dana S. Nau
    AI Game-Playing Techniques. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1999, v:20, n:1, pp:117-118 [Journal]
  83. Enrico Giunchiglia, Nicola Muscettola, Dana S. Nau
    The 2003 International Conference on Automated Planning and Scheduling (ICAPS-03). [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2004, v:25, n:2, pp:129-132 [Journal]
  84. Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila
    TALPlanner: A Temporal Logic-Based Planner. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2001, v:22, n:3, pp:91-64 [Journal]
  85. Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
    Computer Bridge - A Big Win for AI Planning. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1998, v:19, n:2, pp:93-106 [Journal]
  86. Kutluhan Erol, James A. Hendler, Dana S. Nau
    Complexity Results for HTN Planning. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:69-93 [Journal]
  87. Jürgen Dix, Héctor Muñoz-Avila, Dana S. Nau, Lingling Zhang
    IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:37, n:4, pp:381-407 [Journal]
  88. Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal
    On the Asymptotic Performance of IDA*. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:20, n:1-4, pp:161-193 [Journal]
  89. Martti Mäntylä, Dana S. Nau, Jami J. Shah
    Challenges in Feature-Based Manufacturing Research. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:2, pp:77-85 [Journal]
  90. Diganta Das, Satyandra K. Gupta, Dana S. Nau
    Generating redesign suggestions to reduce setup cost: a step towards automated redesign. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1996, v:28, n:10, pp:763-782 [Journal]
  91. Satyandra K. Gupta, Dana S. Nau
    Systematic approach to analysing the manufacturability of machined parts. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1995, v:27, n:5, pp:323-342 [Journal]
  92. William C. Regli, Satyandra K. Gupta, Dana S. Nau
    Towards multiprocessor feature recognition. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1997, v:29, n:1, pp:37-51 [Journal]
  93. Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau
    Algorithms for selecting cutters in multi-part milling problems. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2003, v:35, n:9, pp:825-839 [Journal]
  94. Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
    A Planning Approach to Declarer Play in Contract Bridge. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1996, v:12, n:, pp:106-130 [Journal]
  95. Qiang Yang, Dana S. Nau, James A. Hendler
    Merging Separately Generated Plans with Restricted Interactions. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1992, v:8, n:, pp:648-676 [Journal]
  96. Satyandra K. Gupta, Dana S. Nau, Guangming Zhang
    Concurrent Evaluation of Machinability During Product Design. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1993, v:26, n:1, pp:61-63 [Journal]
  97. Satyandra K. Gupta, Dana S. Nau, William C. Regli
    IMACS: A Case Study in Real-World Planning. [Citation Graph (0, 0)][DBLP]
    IEEE Intelligent Systems, 1998, v:13, n:3, pp:49-60 [Journal]
  98. Dana S. Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, Héctor Muñoz-Avila, J. William Murdock, Dan Wu, Fusun Yaman
    Applications of SHOP and SHOP2. [Citation Graph (0, 0)][DBLP]
    IEEE Intelligent Systems, 2005, v:20, n:2, pp:34-41 [Journal]
  99. Connie Loggia Ramsey, James A. Reggia, Dana S. Nau, Andrew Ferrentino
    A Comparative Analysis of Methods for Expert Systems. [Citation Graph (0, 0)][DBLP]
    International Journal of Man-Machine Studies, 1986, v:24, n:5, pp:475-499 [Journal]
  100. James A. Reggia, Dana S. Nau, Pearl Y. Wang
    Diagnostic Expert Systems Based on a Set Covering Model. [Citation Graph (0, 0)][DBLP]
    International Journal of Man-Machine Studies, 1983, v:19, n:5, pp:437-460 [Journal]
  101. James A. Reggia, Dana S. Nau, Pearl Y. Wang
    A formal model of diagnostic inference. I. Problem formulation and decomposition. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1985, v:37, n:1-3, pp:227-256 [Journal]
  102. James A. Reggia, Dana S. Nau, Pearl Y. Wang, Yun Peng
    A formal model of diagnostic inference, II. Algorithmic solution and application. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1985, v:37, n:1-3, pp:257-285 [Journal]
  103. Dana S. Nau
    Decision Quality As a Function of Search Depth on Game Trees [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:687-708 [Journal]
  104. Dana S. Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dan Wu, Fusun Yaman
    SHOP2: An HTN Planning System. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2003, v:20, n:, pp:379-404 [Journal]
  105. Mihai Ciocoiu, Dana S. Nau, Michael Grüninger
    Ontologies for Integrating Engineering Applications. [Citation Graph (0, 0)][DBLP]
    J. Comput. Inf. Sci. Eng., 2001, v:1, n:1, pp:12-22 [Journal]
  106. Matthew P. Evett, James A. Hendler, Ambuj Mahanti, Dana S. Nau
    PRA*: Massively Parallel Heuristic Search. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:25, n:2, pp:133-143 [Journal]
  107. Raghu Karinthi, Dana S. Nau
    An Algebraic Approach to Feature Interactions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1992, v:14, n:4, pp:469-484 [Journal]
  108. Evren Sirin, Bijan Parsia, Dan Wu, James A. Hendler, Dana S. Nau
    HTN planning for Web Service composition using SHOP2. [Citation Graph (0, 0)][DBLP]
    J. Web Sem., 2004, v:1, n:4, pp:377-396 [Journal]
  109. Ugur Kuter, Evren Sirin, Bijan Parsia, Dana S. Nau, James A. Hendler
    Information gathering during planning for Web Service composition. [Citation Graph (0, 0)][DBLP]
    J. Web Sem., 2005, v:3, n:2-3, pp:183-205 [Journal]
  110. Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila
    Learning to Do HTN Planning. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:390-393 [Conf]
  111. Tsz-Chiu Au, Dana S. Nau
    Reactive Query Policies: A Formalism for Planning with Volatile External Information. [Citation Graph (0, 0)][DBLP]
    CIDM, 2007, pp:243-250 [Conf]
  112. Samir Khuller, Maria Vanina Martinez, Dana S. Nau, Gerardo I. Simari, Amy Sliva, V. S. Subrahmanian
    Finding Most Probable Worlds of Probabilistic Logic Programs. [Citation Graph (0, 0)][DBLP]
    SUM, 2007, pp:45-59 [Conf]

  113. Using Classical Planners to Solve Nondeterministic Planning Problems. [Citation Graph (, )][DBLP]


  114. Thinking Ahead in Real-Time Search. [Citation Graph (, )][DBLP]


  115. Synthesis of strategies from interaction traces. [Citation Graph (, )][DBLP]


  116. Within epsilon of optimal play in the cultaptation social learning game. [Citation Graph (, )][DBLP]


  117. Strategy generation in multi-agent imperfect-information pursuit games. [Citation Graph (, )][DBLP]


  118. Combining Domain-Independent Planning and HTN Planning: The Duet Planner. [Citation Graph (, )][DBLP]


  119. Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning. [Citation Graph (, )][DBLP]


  120. Emergence of cooperative societies in evolutionary games. [Citation Graph (, )][DBLP]


  121. Emergence of cooperative societies in evolutionary games. [Citation Graph (, )][DBLP]


  122. Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. [Citation Graph (, )][DBLP]


  123. Planning for Interactions among Autonomous Agents. [Citation Graph (, )][DBLP]


  124. State-Dependent Risk Preferences in Evolutionary Games. [Citation Graph (, )][DBLP]


  125. Task decomposition on abstract states, for planning under nondeterminism. [Citation Graph (, )][DBLP]


  126. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030, 000 worlds. [Citation Graph (, )][DBLP]


  127. Learning Preconditions for Planning from Plan Traces and HTN Structure. [Citation Graph (, )][DBLP]


Search in 0.230secs, Finished in 0.238secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002