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