default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDana S. Nau
Person information
- affiliation: University of Maryland, College Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c117]Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter:
Surrogate Bayesian Networks for Approximating Evolutionary Games. AISTATS 2024: 2566-2574- [c116]Ruoxi Li, Dana S. Nau, Mark Roberts, Morgan Fine-Morris:
Automatically Learning HTN Methods from Landmarks. FLAIRS 2024 - [i9]Ruoxi Li, Dana S. Nau, Mark Roberts, Morgan Fine-Morris:
Automatically Learning HTN Methods from Landmarks. CoRR abs/2404.06325 (2024) - 2022
- [c115]Vincent Hsiao, Dana S. Nau, Rina Dechter:
Fast Fourier Transform Reductions for Bayesian Network Inference. AISTATS 2022: 6445-6458 - [c114]Vincent Hsiao, Dana S. Nau:
A Mean Field Game Model of Spatial Evolutionary Games. AAMAS 2022: 606-614 - [c113]Yash Bansod, Sunandita Patra, Dana S. Nau, Mark Roberts:
HTN Replanning from the Middle. FLAIRS 2022 - [c112]Sunandita Patra, Mark Cavolowsky, Onur Kulaksizoglu, Ruoxi Li, Laura Hiatt, Mark Roberts, Dana S. Nau:
A Hierarchical Goal-Biased Curriculum for Training Reinforcement Learning. FLAIRS 2022 - 2021
- [j64]Sunandita Patra
, James Mason, Malik Ghallab, Dana S. Nau, Paolo Traverso:
Deliberative acting, planning and learning with hierarchical operational models. Artif. Intell. 299: 103523 (2021) - [c111]Sunandita Patra, Alexander Velazquez, Myong H. Kang, Dana S. Nau:
Using Online Planning and Acting to Recover from Cyberattacks on Software-defined Networks. AAAI 2021: 15377-15384 - [c110]Ruoxi Li, Sunandita Patra, Dana S. Nau:
Decentralized Refinement Planning and Acting. ICAPS 2021: 225-233 - [c109]Vincent Hsiao, Xinyue Pan, Dana S. Nau, Rina Dechter:
Approximating Spatial Evolutionary Games using Bayesian Networks. AAMAS 2021: 1533-1535 - [c108]Sunandita Patra, Paolo Traverso, Malik Ghallab, Dana S. Nau:
Coordination and Control of Hierarchically Organized Interacting Agents. FLAIRS 2021 - 2020
- [c107]Sunandita Patra, James Mason, Amit Kumar, Malik Ghallab, Paolo Traverso, Dana S. Nau:
Integrating Acting, Planning, and Learning in Hierarchical Operational Models. ICAPS 2020: 478-487 - [c106]Xinyue Pan, Dana S. Nau, Michele Gelfand:
Cooperative Norms and the Growth of Threat: Differences Across Tight and Loose Cultures. BESC 2020: 1-6 - [i8]Sunandita Patra, James Mason, Amit Kumar, Malik Ghallab, Paolo Traverso, Dana S. Nau:
Integrating Acting, Planning and Learning in Hierarchical Operational Models. CoRR abs/2003.03932 (2020) - [i7]Sunandita Patra, James Mason, Malik Ghallab, Dana S. Nau, Paolo Traverso:
Deliberative Acting, Online Planning and Learning with Hierarchical Operational Models. CoRR abs/2010.01909 (2020)
2010 – 2019
- 2019
- [c105]Sunandita Patra, Malik Ghallab, Dana S. Nau, Paolo Traverso:
Acting and Planning Using Operational Models. AAAI 2019: 7691-7698 - 2018
- [j63]Inon Zuckerman, Brandon Wilson, Dana S. Nau:
Avoiding game-tree pathology in 2-player adversarial search. Comput. Intell. 34(2): 542-561 (2018) - [j62]Patrik Haslum, Franc Ivankovic, Miquel Ramírez, Dan Gordon, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning. J. Artif. Intell. Res. 62: 373-431 (2018) - [j61]Inon Zuckerman, Kan-Leung Cheng, Dana S. Nau:
Modeling agent's preferences by its designer's social value orientation. J. Exp. Theor. Artif. Intell. 30(2): 257-277 (2018) - [c104]Soham De, Dana S. Nau, Xinyue Pan, Michele J. Gelfand:
Tipping Points for Norm Change in Human Cultures. SBP-BRiMS 2018: 61-69 - [i6]Soham De, Dana S. Nau, Xinyue Pan, Michele J. Gelfand:
Tipping Points for Norm Change in Human Cultures. CoRR abs/1804.07406 (2018) - 2017
- [c103]Soham De, Dana S. Nau, Michele J. Gelfand:
Understanding Norm Change: An Evolutionary Game-Theoretic Approach. AAMAS 2017: 1433-1441 - [i5]Soham De, Dana S. Nau, Michele J. Gelfand:
Understanding Norm Change: An Evolutionary Game-Theoretic Approach (Extended Version). CoRR abs/1704.04720 (2017) - 2016
- [b2]Malik Ghallab, Dana S. Nau, Paolo Traverso:
Automated Planning and Acting. Cambridge University Press 2016, ISBN 978-1-107-03727-4 - [i4]Soham De, Dana S. Nau, Michele Gelfand:
Using Game Theory to Study the Evolution of Cultural Norms. CoRR abs/1606.02570 (2016) - 2015
- [j60]Eric Raboin, Petr Svec, Dana S. Nau, Satyandra K. Gupta:
Model-predictive asset guarding by team of autonomous surface vehicles in environment with civilian boats. Auton. Robots 38(3): 261-282 (2015) - [c102]Dana S. Nau, Malik Ghallab, Paolo Traverso:
Blended Planning and Acting: Preliminary Approach, Research Challenges. AAAI 2015: 4047-4051 - 2014
- [j59]Malik Ghallab, Dana S. Nau, Paolo Traverso:
The actor's view of automated planning and acting: A position paper. Artif. Intell. 208: 1-17 (2014) - [j58]Ronald Alford, Ugur Kuter, Dana S. Nau, Robert P. Goldman:
Plan aggregation for strong cyclic planning in nondeterministic domains. Artif. Intell. 216: 206-232 (2014) - [c101]Vikas Shivashankar, Krishnanand N. Kaipa, Dana S. Nau, Satyandra K. Gupta:
Towards Integrating Hierarchical Goal Networks and Motion Planners to Support Planning for Human Robot Collaboration in Assembly Cells. AAAI Fall Symposia 2014 - [c100]Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
On the Feasibility of Planning Graph Style Heuristics for HTN Planning. ICAPS 2014 - [c99]Franc Ivankovic, Patrik Haslum, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Optimal Planning with Global Numerical State Constraints. ICAPS 2014 - [c98]Kan-Leung Cheng, Inon Zuckerman, Dana S. Nau, Jennifer Golbeck:
Predicting Agents' Behavior by Measuring their Social Preferences. ECAI 2014: 985-986 - 2013
- [j57]Shanchieh Jay Yang, Dana S. Nau, John J. Salerno:
Introduction to the special section on social computing, behavioral-cultural modeling, and prediction. ACM Trans. Intell. Syst. Technol. 4(3): 51:1-51:2 (2013) - [c97]Eric Raboin, Petr Svec, Dana S. Nau, Satyandra K. Gupta:
Model-predictive target defense by team of unmanned surface vehicles operating in uncertain environments. ICRA 2013: 3517-3522 - [c96]Vikas Shivashankar, Ronald Alford, Ugur Kuter, Dana S. Nau:
The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning. IJCAI 2013: 2380-2386 - [p3]Peter I. Cowling, Michael Buro, Michal Bída, Adi Botea, Bruno Bouzy, Martin V. Butz, Philip Hingston, Hector Muñoz-Avila, Dana S. Nau, Moshe Sipper:
Search in Real-Time Video Games. Artificial and Computational Intelligence in Games 2013: 1-19 - [p2]Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, Dana S. Nau:
Pathfinding in Games. Artificial and Computational Intelligence in Games 2013: 21-31 - [i3]Ping-Chung Chi, Dana S. Nau:
Predicting The Performance of Minimax and Product in Game-Tree. CoRR abs/1304.3081 (2013) - [i2]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
An Evaluation of Two Alternatives to Minimax. CoRR abs/1304.3445 (2013) - 2012
- [c95]Vikas Shivashankar, Ugur Kuter, Dana S. Nau, Ronald Alford:
A hierarchical goal-based formalism and algorithm for single-agent planning. AAMAS 2012: 981-988 - [c94]Eric Raboin, Ugur Kuter, Dana S. Nau:
Generating strategies for multi-agent pursuit-evasion games in partially observable Euclidean space. AAMAS 2012: 1201-1202 - [c93]Brandon Wilson, Inon Zuckerman, Austin Parker, Dana S. Nau:
Improving Local Decisions in Adversarial Search. ECAI 2012: 840-845 - [c92]Cody Buntain, Jennifer Golbeck, Dana S. Nau, Sarit Kraus:
Advice and trust in games of choice. PST 2012: 157-158 - [c91]Ronald Alford, Vikas Shivashankar, Ugur Kuter, Dana S. Nau:
HTN Problem Spaces: Structure, Algorithms, Termination. SOCS 2012: 2-9 - 2011
- [j56]Huan Liu, Dana S. Nau:
Introduction. ACM Trans. Intell. Syst. Technol. 3(1): 6:1 (2011) - [c90]Brandon Wilson, Inon Zuckerman, Dana S. Nau:
Modeling social preferences in multi-player games. AAMAS 2011: 337-344 - [c89]Vikas Shivashankar, Rajiv Jain, Ugur Kuter, Dana S. Nau:
Real-Time Planning for Covering an Initially-Unknown Spatial Environment. FLAIRS 2011 - [c88]Kan-Leung Cheng, Inon Zuckerman, Dana S. Nau, Jennifer Golbeck:
The Life Game: Cognitive Strategies for Repeated Stochastic Games. SocialCom/PASSAT 2011: 95-102 - [e2]John J. Salerno, Shanchieh Jay Yang, Dana S. Nau, Sun-Ki Chai:
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 [contents] - [i1]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) - 2010
- [j55]Patrick Roos, Dana S. Nau:
Risk Preference and Sequential Choice in Evolutionary Games. Adv. Complex Syst. 13(4): 559-578 (2010) - [j54]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) - [j53]Huan Liu, Dana S. Nau:
Introduction to the ACM TIST special issue AI in social computing and cultural modeling. ACM Trans. Intell. Syst. Technol. 1(1): 2:1-2:2 (2010) - [j52]Patrick Roos, Ryan Carr, Dana S. Nau:
Evolution of state-dependent risk preferences. ACM Trans. Intell. Syst. Technol. 1(1): 6:1-6:21 (2010) - [c87]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 - [c86]Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana S. Nau:
Emergence of cooperative societies in evolutionary games. GECCO (Companion) 2010: 1793-1800 - [c85]Kan-Leung Cheng, Inon Zuckerman, Ugur Kuter, Dana S. Nau:
Emergence of cooperative societies in evolutionary games. GECCO (Companion) 2010: 2067-2068 - [c84]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 - [c83]Patrick Roos, Dana S. Nau:
State-Dependent Risk Preferences in Evolutionary Games. SBP 2010: 23-31
2000 – 2009
- 2009
- [j51]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) - [c82]Dana S. Nau, Ugur Kuter, Emre Sefer:
Thinking Ahead in Real-Time Search. ICAPS 2009 - [c81]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 - [c80]Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman:
Maintaining Focus: Overcoming Attention Deficit Disorder in Contingent Planning. FLAIRS 2009 - [c79]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 - [p1]Dana S. Nau:
Artificial Intelligence and Automation. Handbook of Automation 2009: 249-268 - 2008
- [j50]Dana S. Nau, Jonathan Wilkenfeld:
Computational Cultural Dynamics. IEEE Intell. Syst. 23(4): 18-19 (2008) - [c78]Eric Raboin, Ryan Carr, Austin Parker, Dana S. Nau:
Balancing Innovation and Exploitation in a Social Learning Game. AAAI Fall Symposium: Adaptive Agents in Cultural Contexts 2008: 44-51 - [c77]Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman:
Using Classical Planners to Solve Nondeterministic Planning Problems. ICAPS 2008: 190-197 - [c76]Tsz-Chiu Au, Sarit Kraus, Dana S. Nau:
Synthesis of strategies from interaction traces. AAMAS (2) 2008: 855-862 - [c75]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 - [c74]Tsz-Chiu Au, Ugur Kuter, Dana S. Nau:
Planning for Interactions among Autonomous Agents. ProMAS 2008: 1-23 - 2007
- [j49]Dana S. Nau:
Current Trends in Automated Planning. AI Mag. 28(4): 43-58 (2007) - [j48]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) - [j47]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 Intell. Syst. 22(2): 12-16 (2007) - [c73]Tsz-Chiu Au, Dana S. Nau:
Reactive Query Policies: A Formalism for Planning with Volatile External Information. CIDM 2007: 243-250 - [c72]Austin Parker, Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
Probabilistic Go Theories. IJCAI 2007: 501-506 - [c71]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 - 2006
- [c70]Austin Parker, Dana S. Nau, V. S. Subrahmanian:
Overconfidence or Paranoia? Search in Imperfect-Information Games. AAAI 2006: 1045-1050 - [c69]Tsz-Chiu Au, Dana S. Nau:
Maintaining Cooperation in Noisy Environments. AAAI 2006: 1567- - [c68]Ugur Kuter, Dana S. Nau:
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond. AAAI 2006: 1638-1641 - [c67]Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila:
Learning to Do HTN Planning. ICAPS 2006: 390-393 - [c66]Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. Subrahmanian:
A stochastic language for modelling opponent agents. AAMAS 2006: 244-246 - [c65]Tsz-Chiu Au, Dana S. Nau:
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma). AAMAS 2006: 561-568 - [c64]Tsz-Chiu Au, Dana S. Nau:
The Incompleteness of Planning with Volatile External Information. ECAI 2006: 839-840 - 2005
- [j46]Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha:
Learning Preconditions for Planning from Plan Traces and HTN Structure. Comput. Intell. 21(4): 388-413 (2005) - [j45]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 Intell. Syst. 20(2): 34-41 (2005) - [j44]Ugur Kuter, Evren Sirin, Bijan Parsia, Dana S. Nau, James A. Hendler:
Information gathering during planning for Web Service composition. J. Web Semant. 3(2-3): 183-205 (2005) - [c63]Ugur Kuter, Dana S. Nau:
Using Domain-Configurable Search Control for Probabilistic Planning. AAAI 2005: 1169-1174 - [c62]Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso:
A Hierarchical Task-Network Planner based on Symbolic Model Checking. ICAPS 2005: 300-309 - [c61]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 - [c60]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 - [c59]Austin Parker, Dana S. Nau, V. S. Subrahmanian:
Game-Tree Search with Combinatorially Large Belief States. IJCAI 2005: 254-259 - [c58]Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
Going Far, Logically. IJCAI 2005: 615-620 - [c57]Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
A Motion Closed World Asumption. IJCAI 2005: 621-626 - [c56]Tsz-Chiu Au, Ugur Kuter, Dana S. Nau:
Web Service Composition with Volatile Information. ISWC 2005: 52-66 - 2004
- [b1]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 - [j43]Enrico Giunchiglia, Nicola Muscettola, Dana S. Nau:
The 2003 International Conference on Automated Planning and Scheduling (ICAPS-03). AI Mag. 25(2): 129-132 (2004) - [j42]Evren Sirin, Bijan Parsia, Dan Wu, James A. Hendler, Dana S. Nau:
HTN planning for Web Service composition using SHOP2. J. Web Semant. 1(4): 377-396 (2004) - [c55]Ugur Kuter, Dana S. Nau:
Forward-Chaining Planning in Nondeterministic Domains. AAAI 2004: 513-518 - [c54]Tsz-Chiu Au, Dana S. Nau, V. S. Subrahmanian:
Utilizing Volatile External Information During Planning. ECAI 2004: 647-651 - [c53]Fusun Yaman, Sibel Adali, Dana S. Nau, Maria Luisa Sapino, V. S. Subrahmanian:
Plan Databases: Model and Algebra. FoIKS 2004: 302-320 - [c52]Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
A Logic of Motion. KR 2004: 85-94 - [c51]Ugur Kuter, Evren Sirin, Dana S. Nau, Bijan Parsia, James A. Hendler:
Information Gathering During Planning for Web Service Composition. ISWC 2004: 335-349 - 2003
- [j41]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) - [j40]Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau:
Algorithms for selecting cutters in multi-part milling problems. Comput. Aided Des. 35(9): 825-839 (2003) - [j39]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. 20: 379-404 (2003) - [c50]Jürgen Dix, Ugur Kuter, Dana S. Nau:
Planning in Answer Set Programming Using Ordered Task Decomposition. KI 2003: 490-504 - [c49]Dan Wu, Bijan Parsia, Evren Sirin, James A. Hendler, Dana S. Nau:
Automating DAML-S Web Services Composition Using SHOP2. ISWC 2003: 195-210 - [c48]Dan Wu, Evren Sirin, James A. Hendler, Dana S. Nau, Bijan Parsia:
Automatic Web Services Composition Using SHOP2. WWW (Posters) 2003 - [e1]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, ISBN 1-57735-187-8 [contents] - 2002
- [c47]Fusun Yaman, Dana S. Nau:
Timeline: An HTN Planner that can Reason about Time. AIPS Workshop on Planning for Temporal Domains 2002: 75-81 - [c46]Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-Avila, David W. Aha:
CaMeL: Learning Method Preconditions for HTN Planning. AIPS 2002: 131-142 - [c45]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 - [c44]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 - [c43]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
- [j38]Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila:
The Shop Planning System. AI Mag. 22(3): 91-64 (2001) - [j37]Mihai Ciocoiu, Dana S. Nau, Michael Grüninger:
Ontologies for Integrating Engineering Applications. J. Comput. Inf. Sci. Eng. 1(1): 12-22 (2001) - [c42]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 - [c41]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 - [c40]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 - 2000
- [j36]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. Artif. Intell. Eng. Des. Anal. Manuf. 14(4): 289-304 (2000) - [c39]Amnon Lotem, Dana S. Nau:
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains. AIPS 2000: 206-215 - [c38]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 - [c37]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 - [c36]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 - [c35]Mihai Ciocoiu, Dana S. Nau:
Ontology-Based Semantics. KR 2000: 539-546
1990 – 1999
- 1999
- [j35]Dana S. Nau:
AI Game-Playing Techniques. AI Mag. 20(1): 117-118 (1999) - [c34]Amnon Lotem, Dana S. Nau, James A. Hendler:
Using Planning Graphs for Solving HTN Planning Problems. AAAI/IAAI 1999: 534-540 - [c33]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 - [c32]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 - [c31]Thomas Vossen, Michael O. Ball, Amnon Lotem, Dana S. Nau:
On the Use of Integer Programming Models in AI Planning. IJCAI 1999: 304-309 - [c30]Dana S. Nau, Yue Cao, Amnon Lotem, Héctor Muñoz-Avila:
SHOP: Simple Hierarchical Ordered Planner. IJCAI 1999: 968-975 - 1998
- [j34]Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop:
Computer Bridge - A Big Win for AI Planning. AI Mag. 19(2): 93-106 (1998) - [j33]Satyandra K. Gupta, Dana S. Nau, William C. Regli:
IMACS: A Case Study in Real-World Planning. IEEE Intell. Syst. 13(3): 49-60 (1998) - [c29]Reiko Tsuneto, James A. Hendler, Dana S. Nau:
Analyzing External Conditions to Improve the Efficiency of HTN Planning. AAAI/IAAI 1998: 913-920 - [c28]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 - [c27]Dana S. Nau, Stephen J. J. Smith, Kutluhan Erol:
Control Strategies in HTN Planning: Theory Versus Practice. AAAI/IAAI 1998: 1127-1133 - 1997
- [j32]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) - [j31]William C. Regli, Satyandra K. Gupta, Dana S. Nau:
Towards multiprocessor feature recognition. Comput. Aided Des. 29(1): 37-51 (1997) - [c26]Reiko Tsuneto, Dana S. Nau, James A. Hendler:
Plan-Refinement Strategies and Search-Space Size. ECP 1997: 414-426 - [c25]Alexei Elinson, Dana S. Nau, William C. Regli:
Feature-Based Similarity Assessment of Solid Models. Symposium on Solid Modeling and Applications 1997: 297-310 - 1996
- [j30]Subbarao Kambhampati, Dana S. Nau:
On the Nature and Role of Modal Truth Criteria in Planning. Artif. Intell. 82(1-2): 129-155 (1996) - [j29]Kutluhan Erol, James A. Hendler, Dana S. Nau:
Complexity Results for HTN Planning. Ann. Math. Artif. Intell. 18(1): 69-93 (1996) - [j28]Subrata Ghosh, Ambuj Mahanti, Rakesh Nagi, Dana S. Nau:
Manufacturing cell formation by state-space search. Ann. Oper. Res. 65(1): 35-54 (1996) - [j27]Martti Mäntylä, Dana S. Nau, Jami J. Shah:
Challenges in Feature-Based Manufacturing Research. Commun. ACM 39(2): 77-85 (1996) - [j26]Diganta Das, Satyandra K. Gupta, Dana S. Nau:
Generating redesign suggestions to reduce setup cost: a step towards automated redesign. Comput. Aided Des. 28(10): 763-782 (1996) - [j25]Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop:
A Planning Approach to Declarer Play in Contract Bridge. Comput. Intell. 12: 106-130 (1996) - [c24]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 - [c23]Reiko Tsuneto, Kutluhan Erol, James A. Hendler, Dana S. Nau:
Commitment Strategies in Hierarchical Task Network Planning. AAAI/IAAI, Vol. 1 1996: 536-542 - 1995
- [j24]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) - [j23]Satyandra K. Gupta, Dana S. Nau:
Systematic approach to analysing the manufacturability of machined parts. Comput. Aided Des. 27(5): 323-342 (1995) - [j22]Matthew P. Evett, James A. Hendler, Ambuj Mahanti, Dana S. Nau:
PRA*: Massively Parallel Heuristic Search. J. Parallel Distributed Comput. 25(2): 133-143 (1995) - [j21]V. S. Subrahmanian, Dana S. Nau, Carlo Vago:
WFS + Branch and Bound = Stable Models. IEEE Trans. Knowl. Data Eng. 7(3): 362-377 (1995) - [c22]Kutluhan Erol, James A. Hendler, Dana S. Nau, Reiko Tsuneto:
A Critical Look at Critics in HTN Planning. IJCAI 1995: 1592-1598 - [c21]Dana S. Nau, Satyandra K. Gupta, William C. Regli:
AI Planning Versus Manufacturing-Operation Planning: A Case Study. IJCAI 1995: 1670-1676 - [c20]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 - 1994
- [j20]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) - [c19]Subbarao Kambhampati, Dana S. Nau:
On the Nature of Modal Truth Criteria in Planning. AAAI 1994: 1055-1060 - [c18]Kutluhan Erol, James A. Hendler, Dana S. Nau:
HTN Planning: Complexity and Expressivity. AAAI 1994: 1123-1128 - [c17]Subrata Ghosh, Ambuj Mahanti, Dana S. Nau:
ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. AAAI 1994: 1353-1358 - [c16]Stephen J. J. Smith, Dana S. Nau:
An Analysis of Forward Pruning. AAAI 1994: 1386-1391 - [c15]Kutluhan Erol, James A. Hendler, Dana S. Nau:
UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning. AIPS 1994: 249-254 - 1993
- [j19]Satyandra K. Gupta, Dana S. Nau, Guangming Zhang:
Concurrent Evaluation of Machinability During Product Design. Computer 26(1): 61-63 (1993) - [c14]William C. Regli, Dana S. Nau:
Building a general approach to feature recognition of Material Removal. Solid Modeling and Applications 1993: 293-302 - [c13]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 - 1992
- [j18]Raghu Karinthi, Dana S. Nau, Qiang Yang:
Handling feature interactions in process-planning. Appl. Artif. Intell. 6(4): 389-415 (1992) - [j17]Naresh Gupta, Dana S. Nau:
On the Complexity of Blocks-World Planning. Artif. Intell. 56(2-3): 223-254 (1992) - [j16]Qiang Yang, Dana S. Nau, James A. Hendler:
Merging Separately Generated Plans with Restricted Interactions. Comput. Intell. 8: 648-676 (1992) - [j15]Daniel Eshner, James A. Hendler, Dana S. Nau:
Incremental planning using conceptual graphs. J. Exp. Theor. Artif. Intell. 4(2): 85-94 (1992) - [j14]Raghu Karinthi, Dana S. Nau:
An Algebraic Approach to Feature Interactions. IEEE Trans. Pattern Anal. Mach. Intell. 14(4): 469-484 (1992) - [c12]Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian:
On the Complexity of Domain-Independent Planning. AAAI 1992: 381-386 - [c11]Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal:
Performance of IDA on Trees and Graphs. AAAI 1992: 539-544 - 1991
- [c10]Naresh Gupta, Dana S. Nau:
Complexity Results for Blocks-World Planning. AAAI 1991: 629-633
1980 – 1989
- 1989
- [c9]Qiang Yang, Dana S. Nau:
Preprocessing Search Spaces for Branch and Bound Search. IJCAI 1989: 349-353 - [c8]Raghu Karinthi, Dana S. Nau:
Using a Feature Algebra for Reasoning about Geometric Feature Interactions. IJCAI 1989: 1219-1224 - 1987
- [c7]Ping-Ching Chi, Dana S. Nau:
Comparing Minimax and Product in a Variety of Games. AAAI 1987: 100-104 - 1986
- [j13]Dana S. Nau, Tien-Chien Chang:
Hierarchical representation of problem-solving knowledge in a frame-based process planning system. Int. J. Intell. Syst. 1(1): 29-44 (1986) - [j12]Connie Loggia Ramsey, James A. Reggia, Dana S. Nau, Andrew Ferrentino:
A Comparative Analysis of Methods for Expert Systems. Int. J. Man Mach. Stud. 24(5): 475-499 (1986) - [j11]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
Experiments on alternatives to minimax. Int. J. Parallel Program. 15(2): 163-183 (1986) - 1985
- [j10]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) - [j9]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) - [c6]Dana S. Nau, Paul Walton Purdom Jr., Chun-Hung Tzeng:
An Evaluation of Two Alternatives to Minimax. UAI 1985: 505-509 - 1984
- [j8]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) - [c5]Dana S. Nau, James A. Reggia:
Relationships Between Deductive and Abductive Inference in Knowledge-Based Diagnostic Problem Solving. Expert Database Workshop 1984: 549-558 - [c4]James A. Reggia, Dana S. Nau:
An Abductive Non-Monotonic Logic. NMR 1984: 385-395 - 1983
- [j7]Dana S. Nau:
Pathology on Game Trees Revisited, and an Alternative to Minimaxing. Artif. Intell. 21(1-2): 221-244 (1983) - [j6]Dana S. Nau:
Expert Computer Systems. Computer 16(2): 63-85 (1983) - [j5]James A. Reggia, Dana S. Nau, Pearl Y. Wang:
Diagnostic Expert Systems Based on a Set Covering Model. Int. J. Man Mach. Stud. 19(5): 437-460 (1983) - [j4]Dana S. Nau:
On game graph structure and its influence on pathology. Int. J. Parallel Program. 12(6): 367-383 (1983) - [j3]Dana S. Nau:
Decision Quality As a Function of Search Depth on Game Trees. J. ACM 30(4): 687-708 (1983) - [c3]James A. Reggia, Dana S. Nau, Pearl Y. Wang:
A New Inference Method for Frame-Based Expert Systems. AAAI 1983: 333-337 - 1982
- [j2]Dana S. Nau:
The Last Player Theorem. Artif. Intell. 18(1): 53-65 (1982) - [j1]Dana S. Nau:
An Investigation of the Causes of Pathology in Games. Artif. Intell. 19(3): 257-278 (1982) - [c2]Dana S. Nau, Vipin Kumar, Laveen N. Kanal:
A General Paradigm for A.I. Search Procedures. AAAI 1982: 120-123 - 1980
- [c1]Dana S. Nau:
Pathology on Game Trees: A Summary of Results. AAAI 1980: 102-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
