Dana S. Nau

Ping-Chung Chi, Dana S. Nau: Predicting The Performance of Minimax and Product in Game-Tree. CoRR abs/1304.3081 (2013)

Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng: An Evaluation of Two Alternatives to Minimax. CoRR abs/1304.3445 (2013)

Vikas Shivashankar, Ugur Kuter, Dana S. Nau, Ronald Alford: A hierarchical goal-based formalism and algorithm for single-agent planning. AAMAS 2012: 981-988

Eric Raboin, Ugur Kuter, Dana S. Nau: Generating strategies for multi-agent pursuit-evasion games in partially observable Euclidean space. AAMAS 2012: 1201-1202

Brandon Wilson, Inon Zuckerman, Austin Parker, Dana S. Nau: Improving Local Decisions in Adversarial Search. ECAI 2012: 840-845

Cody Buntain, Jennifer Golbeck, Dana S. Nau, Sarit Kraus: Advice and trust in games of choice. PST 2012: 157-158

Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau: HTN Problem Spaces: Structure, Algorithms, Termination. SOCS 2012

Huan Liu, Dana S. Nau: Introduction. ACM TIST 3(1): 6 (2011)

Brandon Wilson, Inon Zuckerman, Dana S. Nau: Modeling social preferences in multi-player games. AAMAS 2011: 337-344

Vikas Shivashankar, Rajiv Jain, Ugur Kuter, Dana S. Nau: Real-Time Planning for Covering an Initially-Unknown Spatial Environment. FLAIRS Conference 2011

Kan-Leung Cheng, Inon Zuckerman, Dana S. Nau, Jennifer Golbeck: The Life Game: Cognitive Strategies for Repeated Stochastic Games. SocialCom/PASSAT 2011: 95-102

John J. Salerno, Shanchieh Jay Yang, Dana S. Nau, Sun-Ki Chai (Eds.): Social Computing, Behavioral-Cultural Modeling and Prediction - 4th International Conference, SBP 2011, College Park, MD, USA, March 29-31, 2011. Proceedings. Lecture Notes in Computer Science 6589, Springer 2011, isbn 978-3-642-19655-3

Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dana S. Nau, Dan Wu, Fusun Yaman: SHOP2: An HTN Planning System. CoRR abs/1106.4869 (2011)

Patrick Roos, Dana S. Nau: Risk Preference and Sequential Choice in Evolutionary Games. Advances in Complex Systems 13(4): 559-578 (2010)

Dana S. Nau, Mitja Lustrek, Austin Parker, Ivan Bratko, Matjaz Gams: When is it better not to look ahead? Artif. Intell. 174(16-17): 1323-1338 (2010)

Huan Liu, Dana S. Nau: Introduction to the ACM TIST special issue AI in social computing and cultural modeling. ACM TIST 1(1): 2 (2010)

Patrick Roos, Ryan Carr, Dana S. Nau: Evolution of state-dependent risk preferences. ACM TIST 1(1): 6 (2010)

Eric Raboin, Dana S. Nau, Ugur Kuter, Satyandra K. Gupta, Petr Svec: Strategy generation in multi-agent imperfect-information pursuit games. AAMAS 2010: 947-954

Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana S. Nau: Emergence of cooperative societies in evolutionary games. GECCO (Companion) 2010: 1793-1800

Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana S. Nau: Emergence of cooperative societies in evolutionary games. GECCO (Companion) 2010: 2067-2068

Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana S. Nau: Using a Social Orientation Model for the Evolution of Cooperative Societies. IAT 2010: 431-438

Patrick Roos, Dana S. Nau: State-Dependent Risk Preferences in Evolutionary Games. SBP 2010: 23-31

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)

Dana S. Nau, Ugur Kuter, Emre Sefer: Thinking Ahead in Real-Time Search. ICAPS 2009

Ryan Carr, Eric Raboin, Austin Parker, Dana S. Nau: Within epsilon of optimal play in the cultaptation social learning game. AAMAS (2) 2009: 1327-1328

Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman: Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning. FLAIRS Conference 2009

Ronald Alford, Ugur Kuter, Dana S. Nau: Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way. IJCAI 2009: 1629-1634

Dana S. Nau: Artificial Intelligence and Automation. Handbook of Automation 2009: 249-268

Dana S. Nau, Jonathan Wilkenfeld: Computational Cultural Dynamics. IEEE Intelligent Systems 23(4): 18-19 (2008)

Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman: Using Classical Planners to Solve Nondeterministic Planning Problems. ICAPS 2008: 190-197

Tsz-Chiu Au, Sarit Kraus, Dana S. Nau: Synthesis of strategies from interaction traces. AAMAS (2) 2008: 855-862

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

Tsz-Chiu Au, Ugur Kuter, Dana S. Nau: Planning for Interactions among Autonomous Agents. ProMAS 2008: 1-23

Dana S. Nau: Current Trends in Automated Planning. AI Magazine 28(4): 43-58 (2007)

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 10^{30, 000} worlds. Ann. Math. Artif. Intell. 51(2-4): 295-331 (2007)

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)

Tsz-Chiu Au, Dana S. Nau: Reactive Query Policies: A Formalism for Planning with Volatile External Information. CIDM 2007: 243-250

Austin Parker, Fusun Yaman, Dana S. Nau, V. S. Subrahmanian: Probabilistic Go Theories. IJCAI 2007: 501-506

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

Austin Parker, Dana S. Nau, V. S. Subrahmanian: Overconfidence or Paranoia? Search in Imperfect-Information Games. AAAI 2006: 1045-1050

Tsz-Chiu Au, Dana S. Nau: Maintaining Cooperation in Noisy Environments. AAAI 2006: 1567-

Ugur Kuter, Dana S. Nau: Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond. AAAI 2006: 1638-1641

Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila: Learning to Do HTN Planning. ICAPS 2006: 390-393

Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. Subrahmanian: A stochastic language for modelling opponent agents. AAMAS 2006: 244-246

Tsz-Chiu Au, Dana S. Nau: Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma). AAMAS 2006: 561-568

Tsz-Chiu Au, Dana S. Nau: The Incompleteness of Planning with Volatile External Information. ECAI 2006: 839-840

Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha: Learning Preconditions for Planning from Plan Traces and HTN Structure. Computational Intelligence 21(4): 388-413 (2005)

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)

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)

Ugur Kuter, Dana S. Nau: Using Domain-Configurable Search Control for Probabilistic Planning. AAAI 2005: 1169-1174

Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso: A Hierarchical Task-Network Planner based on Symbolic Model Checking. ICAPS 2005: 300-309

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

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

Austin Parker, Dana S. Nau, V. S. Subrahmanian: Game-Tree Search with Combinatorially Large Belief States. IJCAI 2005: 254-259

Fusun Yaman, Dana S. Nau, V. S. Subrahmanian: Going Far, Logically. IJCAI 2005: 615-620

Fusun Yaman, Dana S. Nau, V. S. Subrahmanian: A Motion Closed World Asumption. IJCAI 2005: 621-626

Tsz-Chiu Au, Ugur Kuter, Dana S. Nau: Web Service Composition with Volatile Information. International Semantic Web Conference 2005: 52-66

Malik Ghallab, Dana S. Nau, Paolo Traverso: Automated planning - theory and practice. Elsevier 2004, isbn 978-1-55860-856-6, pp. I-XXVIII, 1-635

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)

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)

Ugur Kuter, Dana S. Nau: Forward-Chaining Planning in Nondeterministic Domains. AAAI 2004: 513-518

Tsz-Chiu Au, Dana S. Nau, V. S. Subrahmanian: Utilizing Volatile External Information During Planning. ECAI 2004: 647-651

Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa Sapino, V. S. Subrahmanian: Plan Databases: Model and Algebra. FoIKS 2004: 302-320

Fusun Yaman, Dana S. Nau, V. S. Subrahmanian: A Logic of Motion. KR 2004: 85-94

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

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)

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)

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)

Jürgen Dix, Ugur Kuter, Dana S. Nau: Planning in Answer Set Programming Using Ordered Task Decomposition. KI 2003: 490-504

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

Dan Wu, Evren Sirin, James A. Hendler, Dana S. Nau, Bijan Parsia: Automatic Web Services Composition Using SHOP2. WWW (Posters) 2003

Enrico Giunchiglia, Nicola Muscettola, Dana S. Nau (Eds.): Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), June 9-13, 2003, Trento, Italy. AAAI 2003, isbn 1-57735-187-8

Fusun Yaman, Dana S. Nau: Timeline: An HTN Planner that can Reason about Time. AIPS Workshop on Planning for Temporal Domains 2002: 75-81

Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha: CaMeL: Learning Method Preconditions for HTN Planning. AIPS 2002: 131-142

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

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

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

Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila: The Shop Planning System. AI Magazine 22(3): 91-64 (2001)

Mihai Ciocoiu, Dana S. Nau, Michael Grüninger: Ontologies for Integrating Engineering Applications. J. Comput. Inf. Sci. Eng. 1(1): 12-22 (2001)

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

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

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

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)

Amnon Lotem, Dana S. Nau: New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains. AIPS 2000: 206-215

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

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

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

Mihai Ciocoiu, Dana S. Nau: Ontology-Based Semantics. KR 2000: 539-546

Dana S. Nau: AI Game-Playing Techniques. AI Magazine 20(1): 117-118 (1999)

Amnon Lotem, Dana S. Nau, James A. Hendler: Using Planning Graphs for Solving HTN Planning Problems. AAAI/IAAI 1999: 534-540

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

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

Thomas Vossen, Michael O. Ball, Amnon Lotem, Dana S. Nau: On the Use of Integer Programming Models in AI Planning. IJCAI 1999: 304-309

Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila: SHOP: Simple Hierarchical Ordered Planner. IJCAI 1999: 968-975

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)

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)

Reiko Tsuneto, James A. Hendler, Dana S. Nau: Analyzing External Conditions to Improve the Efficiency of HTN Planning. AAAI/IAAI 1998: 913-920

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

Dana S. Nau, Stephen J. J. Smith, Kutluhan Erol: Control Strategies in HTN Planning: Theory Versus Practice. AAAI/IAAI 1998: 1127-1133

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)

William C. Regli, Satyandra K. Gupta, Dana S. Nau: Towards multiprocessor feature recognition. Computer-Aided Design 29(1): 37-51 (1997)

Reiko Tsuneto, Dana S. Nau, James A. Hendler: Plan-Refinement Strategies and Search-Space Size. ECP 1997: 414-426

Alexei Elinson, Dana S. Nau, William C. Regli: Feature-Based Similarity Assessment of Solid Models. Symposium on Solid Modeling and Applications 1997: 297-310

Subbarao Kambhampati, Dana S. Nau: On the Nature and Role of Modal Truth Criteria in Planning. Artif. Intell. 82(1-2): 129-155 (1996)

Kutluhan Erol, James A. Hendler, Dana S. Nau: Complexity Results for HTN Planning. Ann. Math. Artif. Intell. 18(1): 69-93 (1996)

Martti Mäntylä, Dana S. Nau, Jami J. Shah: Challenges in Feature-Based Manufacturing Research. Commun. ACM 39(2): 77-85 (1996)

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)

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)

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

Reiko Tsuneto, Kutluhan Erol, James A. Hendler, Dana S. Nau: Commitment Strategies in Hierarchical Task Network Planning. AAAI/IAAI, Vol. 1 1996: 536-542

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)

Satyandra K. Gupta, Dana S. Nau: Systematic approach to analysing the manufacturability of machined parts. Computer-Aided Design 27(5): 323-342 (1995)

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)

V. S. Subrahmanian, Dana S. Nau, Carlo Vago: WFS + Branch and Bound = Stable Models. IEEE Trans. Knowl. Data Eng. 7(3): 362-377 (1995)

Kutluhan Erol, James A. Hendler, Dana S. Nau, Reiko Tsuneto: A Critical Look at Critics in HTN Planning. IJCAI 1995: 1592-1598

Dana S. Nau, Satyandra K. Gupta, William C. Regli: AI Planning Versus Manufacturing-Operation Planning: A Case Study. IJCAI 1995: 1670-1676

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

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)

Subbarao Kambhampati, Dana S. Nau: On the Nature of Modal Truth Criteria in Planning. AAAI 1994: 1055-1060

Kutluhan Erol, James A. Hendler, Dana S. Nau: HTN Planning: Complexity and Expressivity. AAAI 1994: 1123-1128

Subrata Ghosh, Ambuj Mahanti, Dana S. Nau: ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. AAAI 1994: 1353-1358

Stephen J. J. Smith, Dana S. Nau: An Analysis of Forward Pruning. AAAI 1994: 1386-1391

Kutluhan Erol, James A. Hendler, Dana S. Nau: UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning. AIPS 1994: 249-254

Satyandra K. Gupta, Dana S. Nau, Guangming Zhang: Concurrent Evaluation of Machinability During Product Design. IEEE Computer 26(1): 61-63 (1993)

William C. Regli, Dana S. Nau: Building a general approach to feature recognition of Material Removal. Solid Modeling and Applications 1993: 293-302

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

Raghu Karinthi, Dana S. Nau, Qiang Yang: Handling feature interactions in process-planning. Applied Artificial Intelligence 6(4): 389-415 (1992)

Naresh Gupta, Dana S. Nau: On the Complexity of Blocks-World Planning. Artif. Intell. 56(2-3): 223-254 (1992)

Qiang Yang, Dana S. Nau, James A. Hendler: Merging Separately Generated Plans with Restricted Interactions. Computational Intelligence 8: 648-676 (1992)

Daniel Eshner, James A. Hendler, Dana S. Nau: Incremental planning using conceptual graphs. J. Exp. Theor. Artif. Intell. 4(2): 85-94 (1992)

Raghu Karinthi, Dana S. Nau: An Algebraic Approach to Feature Interactions. IEEE Trans. Pattern Anal. Mach. Intell. 14(4): 469-484 (1992)

Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian: On the Complexity of Domain-Independent Planning. AAAI 1992: 381-386

Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal: Performance of IDA on Trees and Graphs. AAAI 1992: 539-544

Naresh Gupta, Dana S. Nau: Complexity Results for Blocks-World Planning. AAAI 1991: 629-633

Qiang Yang, Dana S. Nau: Preprocessing Search Spaces for Branch and Bound Search. IJCAI 1989: 349-353

Raghu Karinthi, Dana S. Nau: Using a Feature Algebra for Reasoning about Geometric Feature Interactions. IJCAI 1989: 1219-1224

Ping-Ching Chi, Dana S. Nau: Comparing Minimax and Product in a Variety of Games. AAAI 1987: 100-104

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)

Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng: Experiments on alternatives to minimax. International Journal of Parallel Programming 15(2): 163-183 (1986)

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)

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)

Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng: An Evaluation of Two Alternatives to Minimax. UAI 1985: 505-509

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)

Dana S. Nau, James A. Reggia: Relationships Between Deductive and Abductive Inference in Knowledge-Based Diagnostic Problem Solving. Expert Database Workshop 1984: 549-558

James A. Reggia, Dana S. Nau: An Abductive Non-Monotonic Logic. NMR 1984: 385-395

Dana S. Nau: Pathology on Game Trees Revisited, and an Alternative to Minimaxing. Artif. Intell. 21(1-2): 221-244 (1983)

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)

Dana S. Nau: On game graph structure and its influence on pathology. International Journal of Parallel Programming 12(6): 367-383 (1983)

Dana S. Nau: Decision Quality As a Function of Search Depth on Game Trees. J. ACM 30(4): 687-708 (1983)

James A. Reggia, Dana S. Nau, Pearl Y. Wang: A New Inference Method for Frame-Based Expert Systems. AAAI 1983: 333-337

Dana S. Nau: The Last Player Theorem. Artif. Intell. 18(1): 53-65 (1982)

Dana S. Nau: An Investigation of the Causes of Pathology in Games. Artif. Intell. 19(3): 257-278 (1982)

Dana S. Nau, Vipin Kumar, Laveen N. Kanal: A General Paradigm for A.I. Search Procedures. AAAI 1982: 120-123

Dana S. Nau: Pathology on Game Trees: A Summary of Results. AAAI 1980: 102-104