![]() | 2009 | |
---|---|---|
121 | ![]() ![]() ![]() ![]() ![]() ![]() | Nan Li, William Cushing, Subbarao Kambhampati, Sung Wook Yoon: Learning User Plan Preferences Obfuscated by Feasibility Constraints. ICAPS 2009 |
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Nan Li, Subbarao Kambhampati, Sung Wook Yoon: Learning Probabilistic Hierarchical Task Networks to Capture User Preferences. IJCAI 2009: 1754-1759 |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Tuan A. Nguyen, Minh Binh Do, Subbarao Kambhampati, Biplav Srivastava: Planning with Partial Preference Models. IJCAI 2009: 1772-1777 |
118 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul W. Schermerhorn, J. Benton, Matthias Scheutz, Kartik Talamadupula, Subbarao Kambhampati: Finding and exploiting goal opportunities in real-time during plan execution. IROS 2009: 3912-3917 |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Benton, Minh Binh Do, Subbarao Kambhampati: Anytime heuristic search for partial satisfaction planning. Artif. Intell. 173(5-6): 562-592 (2009) |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Garrett Wolf, Aravind Kalavagattu, Hemal Khatri, Raju Balakrishnan, Bhaumik Chokshi, Jianchun Fan, Yi Chen, Subbarao Kambhampati: Query processing over incomplete autonomous databases: query rewriting using learned data dependencies. VLDB J. 18(5): 1167-1190 (2009) |
2008 | ||
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Sung Wook Yoon, Alan Fern, Robert Givan, Subbarao Kambhampati: Probabilistic Planning via Determinization in Hindsight. AAAI 2008: 1010-1016 |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Sung Wook Yoon, J. Benton, Subbarao Kambhampati: An Online Learning Method for Improving Over-Subscription Planning. ICAPS 2008: 404-411 |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Raju Balakrishnan, Subbarao Kambhampati: Optimal Ad-Ranking for Profit Maximization. WebDB 2008 |
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Bryce, Subbarao Kambhampati, David E. Smith: Sequential Monte Carlo in reachability heuristics for probabilistic planning. Artif. Intell. 172(6-7): 685-715 (2008) |
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Menkes Hector Louis van den Briel, Thomas Vossen, Subbarao Kambhampati: Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective. J. Artif. Intell. Res. (JAIR) 31: 217-257 (2008) |
2007 | ||
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models. AAAI 2007: 1601- |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Garrett Wolf, Hemal Khatri, Yi Chen, Subbarao Kambhampati: QUIC: A System for Handling Imprecision & Incompleteness in Autonomous Databases (Demo). CIDR 2007: 263-268 |
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Menkes van den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen: An LP-Based Heuristic for Optimal Planning. CP 2007: 651-665 |
107 | ![]() ![]() ![]() ![]() ![]() ![]() | William Cushing, Daniel S. Weld, Subbarao Kambhampati, Mausam, Kartik Talamadupula: Evaluating Temporal Planning Domains. ICAPS 2007: 105-112 |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Benton, Menkes van den Briel, Subbarao Kambhampati: A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems. ICAPS 2007: 34-41 |
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kambhampati: QPIAD: Query Processing over Incomplete Autonomous Databases. ICDE 2007: 1430-1432 |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | William Cushing, Subbarao Kambhampati, Mausam, Daniel S. Weld: When is Temporal Planning Really Temporal? IJCAI 2007: 1852-1859 |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, J. Benton, Menkes van den Briel, Subbarao Kambhampati: Planning with Goal Utility Dependencies. IJCAI 2007: 1872-1878 |
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini, Subbarao Kambhampati, Minh Binh Do, Ivan Serina: Domain Independent Approaches for Finding Diverse Plans. IJCAI 2007: 2016-2022 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, Yi Chen, Subbarao Kambhampati: Query Processing over Incomplete Autonomous Databases. VLDB 2007: 651-662 |
2006 | ||
100 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Supporting Queries with Imprecise Constraints. AAAI 2006 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Bryce, Subbarao Kambhampati, David E. Smith: Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics. ICAPS 2006: 233-242 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Answering Imprecise Queries over Autonomous Web Databases. ICDE 2006: 45 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Bryce, Subbarao Kambhampati, David E. Smith: Planning Graph Heuristics for Belief Space Search. J. Artif. Intell. Res. (JAIR) 26: 35-99 (2006) |
2005 | ||
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuela M. Veloso, Subbarao Kambhampati: Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA AAAI Press / The MIT Press 2005 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati: The Case for Automated Planning in Autonomic Computing. ICAC 2005: 331-332 |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Romeo Sanchez Nigenda, Subbarao Kambhampati: Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems. ICAPS 2005: 192-201 |
93 | ![]() ![]() ![]() ![]() ![]() ![]() | Menkes van den Briel, Thomas Vossen, Subbarao Kambhampati: Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework. ICAPS 2005: 310-319 |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Benton, Minh Binh Do, Subbarao Kambhampati: Over-Subscription Planning with Numeric Goals. IJCAI 2005: 1207-1213 |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Bryce, Subbarao Kambhampati: Cost Sensitive Reachability Heuristics for Handling State Uncertainty. UAI 2005: 60-68 |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Answering Imprecise Queries over Web Databases. VLDB 2005: 1350-1353 |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Hernandez, Subbarao Kambhampati: Improving text collection selection with coverage and overlap statistics. WWW (Special interest tracks and posters) 2005: 1128-1129 |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Manuela M. Veloso, Subbarao Kambhampati: The Twentieth National Conference on Artificial Intelligence. AI Magazine 26(4): 100-101 (2005) |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar: Effectively Mining and Using Coverage and Overlap Statistics for Data Integration. IEEE Trans. Knowl. Data Eng. 17(5): 638-651 (2005) |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Terry Zimmerman, Subbarao Kambhampati: Using Memory to Transform Search on the Planning Graph. J. Artif. Intell. Res. (JAIR) 23: 533-585 (2005) |
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Menkes van den Briel, Subbarao Kambhampati: Optiplan: Unifying IP-based and Graph-based Planning. J. Artif. Intell. Res. (JAIR) 24: 919-931 (2005) |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Jianchun Fan, Subbarao Kambhampati: A snapshot of public web services. SIGMOD Record 34(1): 24-32 (2005) |
2004 | ||
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Menkes van den Briel, Romeo Sanchez Nigenda, Minh Binh Do, Subbarao Kambhampati: Effective Approaches for Partial Satisfaction (Over-Subscription) Planning. AAAI 2004: 562-569 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel Bryce, Subbarao Kambhampati: Heuristic Guidance Measures for Conformant Planning. ICAPS 2004: 365-375 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati: A Frequency-based Approach for Mining Coverage Statistics in Data Integration. ICDE 2004: 387-398 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Providing ranked relevant results for web database queries. WWW (Alternate Track Papers & Posters) 2004: 314-315 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries. WebDB 2004: 73-78 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Eric Lambrecht, Ullas Nambiar, Zaiqing Nie, Senthil Gnanaprakasam: Optimizing Recursive Information Gathering Plans in EMERAC. J. Intell. Inf. Syst. 22(2): 119-153 (2004) |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Hernandez, Subbarao Kambhampati: Integration of Biological Sources: Current Systems and Challenges Ahead. SIGMOD Record 33(3): 51-60 (2004) |
2003 | ||
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Craig A. Knoblock: Proceedings of IJCAI-03 Workshop on Information Integration on the Web (IIWeb-03), August 9-10, 2003, Acapulco, Mexico IIWeb 2003 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Improving Temporal Flexibility of Position Constrained Metric Temporal Plans. ICAPS 2003: 42-51 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati: Frequency-Based Coverage Statistics Mining for Data Integration. IIWeb 2003: 123-128 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Romeo Sanchez Nigenda, Subbarao Kambhampati: Parallelizing State Space Plans Online. IJCAI 2003: 1522-1523 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Terry Zimmerman, Subbarao Kambhampati: Using Available Memory to Transform Graphplan's Search. IJCAI 2003: 1526- |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati, Thomas Hernandez: BibFinder/StatMiner: Effectively Mining and Using Coverage and Overlap Statistics in Data Integration. VLDB 2003: 1097-1100 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Ullas Nambiar, Subbarao Kambhampati: Answering imprecise database queries: a novel approach. WIDM 2003: 126-133 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Terry Zimmerman, Subbarao Kambhampati: Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward. AI Magazine 24(2): 73-96 (2003) |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Alexander Nareyek, Subbarao Kambhampati: Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming. Constraints 8(4): 335-338 (2003) |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Craig A. Knoblock: Guest Editors' Introduction: Information Integration on the Web. IEEE Intelligent Systems 18(5): 14-15 (2003) |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Romeo Sanchez Nigenda, Subbarao Kambhampati: AltAltp: Online Parallelization of Plans with Heuristic State Search. J. Artif. Intell. Res. (JAIR) 19: 631-657 (2003) |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Sapa: A Multi-objective Metric Temporal Planner. J. Artif. Intell. Res. (JAIR) 20: 155-194 (2003) |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Craig A. Knoblock: Information integration on the Web: a view from AI and databases (report on IIWeb-03). SIGMOD Record 32(4): 122-123 (2003) |
2002 | ||
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Planning Graph-based Heuristics for Cost-sensitive Temporal Planning. AIPS 2002: 3-12 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Improving the Temporal Flexibility of Position Constrained Temporal Plans. AIPS Workshop on Planning for Temporal Domains 2002: 41-46 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Ullas Nambiar, Sreelakshmi Vaddi, Subbarao Kambhampati: Mining coverage statistics for websource selection in a mediator. CIKM 2002: 678-680 |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | XuanLong Nguyen, Subbarao Kambhampati, Romeo Sanchez Nigenda: Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artif. Intell. 135(1-2): 73-123 (2002) |
2001 | ||
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati: Joint Optimization of Cost and Coverage of Query Plans in Data Integration. CIKM 2001: 223-230 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | XuanLong Nguyen, Subbarao Kambhampati: Reviving Partial Order Planning. IJCAI 2001: 459-466 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar, Sreelakshmi Vaddi: Mining source coverage statistics for data integration. WIDM 2001: 1-8 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati, Minh Binh Do: Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan. Artif. Intell. 131(1-2): 73-134 (2001) |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artif. Intell. 132(2): 151-182 (2001) |
2000 | ||
54 | ![]() ![]() ![]() ![]() ![]() ![]() | XuanLong Nguyen, Subbarao Kambhampati: Extracting Effective and Admissible State Space Heuristics from the Planning Graph. AAAI/IAAI 2000: 798-805 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Biplav Srivastava, Subbarao Kambhampati: Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning. AIPS 2000: 308-314 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Romeo Sanchez Nigenda: Distance-Based Goal-Ordering Heuristics for Graphplan. AIPS 2000: 315-322 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Minh Binh Do, Subbarao Kambhampati: Solving Planning-Graph by Compiling It into CSP. AIPS 2000: 82-91 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan. J. Artif. Intell. Res. (JAIR) 12: 1-34 (2000) |
1999 | ||
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Amol Dattatraya Mali, Subbarao Kambhampati: On the utility of Plan-space (Causal) Encodings. AAAI/IAAI 1999: 557-563 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Terry Zimmerman, Subbarao Kambhampati: Exploiting Symmetry in the Planning graph via Explanation-Guided Search. AAAI/IAAI 1999: 605-611 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati: Scaling up Planning by Teasing out Resource Scheduling. ECP 1999: 172-186 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Eric Lambrecht, Subbarao Kambhampati, Senthil Gnanaprakasam: Optimizing Recursive Information-Gathering Plans. IJCAI 1999: 1204-1211 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Improving Graphplan's Search with EBL & DDB Techniques. IJCAI 1999: 982-987 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Senthil Gnanaprakasam: Optimizing source-call ordering in Information Gathering Plans. Intelligent Information Integration 1999 |
1998 | ||
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Amol Dattatraya Mali, Biplav Srivastava: Hybrid Planning for Partially Hierarchical Domains. AAAI/IAAI 1998: 882-888 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Amol Dattatraya Mali, Subbarao Kambhampati: Encoding HTN Planning in Propositional Logic. AIPS 1998: 190-198 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning. Artif. Intell. 105(1-2): 161-208 (1998) |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati: Synthesizing Customized Planners from Specifications CoRR cs.AI/9803101: (1998) |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati: Synthesizing Customized Planners from Specifications. J. Artif. Intell. Res. (JAIR) 8: 93-128 (1998) |
1997 | ||
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati, Amol Dattatraya Mali: A Structured Approach for Synthesizing Planners from Specifications. ASE 1997: 18-27 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Eric Parker, Eric Lambrecht: Understanding and Extending Graphplan. ECP 1997: 260-272 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Challenges in Bridging Plan Synthesis Paradigms. IJCAI (1) 1997: 44-49 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas Dean, Subbarao Kambhampati: Planning and Scheduling. The Computer Science and Engineering Handbook 1997: 614-636 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Refinement Planning as a Unifying Framework for Plan Synthesis. AI Magazine 18(2): 67-97 (1997) |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Laurie H. Ihrig, Subbarao Kambhampati: Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures CoRR cs.AI/9711102: (1997) |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Laurie H. Ihrig, Subbarao Kambhampati: Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures. J. Artif. Intell. Res. (JAIR) 7: 161-198 (1997) |
1996 | ||
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search. AAAI/IAAI, Vol. 1 1996: 757-762 |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Laurie H. Ihrig, Subbarao Kambhampati: Design and Implementation of a Replay Framework Based on a Partial Order Planner. AAAI/IAAI, Vol. 1 1996: 849-854 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Refinement Planning: Status and Prospectus. AAAI/IAAI, Vol. 2 1996: 1331-1336 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Biplav Srivastava, Subbarao Kambhampati: Blocking as a Middle-Ground for Step-Order Commitments in Planning. AAAI/IAAI, Vol. 2 1996: 1409 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Terry Zimmerman, Subbarao Kambhampati: Neural Network Guided Search Control in Partial Order Planning. AAAI/IAAI, Vol. 2 1996: 1418 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Laurie H. Ihrig, Biplav Srivastava: A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning. AIPS 1996: 125-133 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Xiuping Yang: On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning. KR 1996: 135-146 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Dana S. Nau: On the Nature and Role of Modal Truth Criteria in Planning. Artif. Intell. 82(1-2): 129-155 (1996) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Suresh Katukam, Yong Qu: Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach. Artif. Intell. 88(1-2): 253-315 (1996) |
1995 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Admissible Pruning Strategies based on plan minimality for Plan-Space Planning. IJCAI 1995: 1627-1635 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: AI Planning: A Prospectus on Theory and Applications. ACM Comput. Surv. 27(3): 334-336 (1995) |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang: Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning. Artif. Intell. 76(1-2): 167-238 (1995) |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: A Comparative Analysis of Partial Order Planning and Task Reduction Planning. SIGART Bulletin 6(1): 16-25 (1995) |
1994 | ||
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Dana S. Nau: On the Nature of Modal Truth Criteria in Planning. AAAI 1994: 1055-1060 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Suresh Katukam, Subbarao Kambhampati: Learning Explanation-Based Search Control Rules for Partial Order Planning. AAAI 1994: 582-587 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Laurie H. Ihrig, Subbarao Kambhampati: Derivation Replay for Partial-Order Planning. AAAI 1994: 992-997 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Design Tradeoffs in Partial Order (Plan space) Planning. AIPS 1994: 92-97 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Refinement Search as a Unifying Framework for Analyzing Planning Algorithms. KR 1994: 329-340 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: A Unified Framework for Explanation-Based Generalization of Partially Ordered and Partially Instantiated Plans. Artif. Intell. 67(1): 29-70 (1994) |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation. Artif. Intell. 69(1-2): 235-278 (1994) |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Exploiting Causal Structure to Control Retrieval and Refitting during Plan Reuse. Computational Intelligence 10: 212-244 (1994) |
1993 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Jengchin Chen: Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning. AAAI 1993: 514-519 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: On the Utility of Systematicity: Understanding Tradeoffs between Redundancy and Commitment in Partial-ordering Planning. IJCAI 1993: 1380-1387 |
1992 | ||
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, James A. Hendler: A Validation-Structure-Based Theory of Plan Modification and Reuse. Artif. Intell. 55(2): 193-258 (1992) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Gregory Olsen, Subbarao Kambhampati, Mark R. Cutkosky: Real Physics for Real Engineers: Response to Prolegomena to Any Future Qualitative Physics. Computational Intelligence 8: 286-288 (1992) |
1991 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Mark R. Cutkosky, Marty Tenenbaum, Soo Hong Lee: Combining Specialized Reasoners and General Purpose Planners: A Case Study. AAAI 1991: 199-205 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, Smadar Kedar: Explanation-Based Generalization of Partially Ordered Plans. AAAI 1991: 679-685 |
1990 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: Mapping and Retrieval During Plan Reuse: A Validation Structure Based Approach. AAAI 1990: 170-175 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati: A Theory of Plan Modification. AAAI 1990: 176-182 |
1989 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, James A. Hendler: Control of Refitting during Plan Reuse. IJCAI 1989: 943-948 |
1988 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Subbarao Kambhampati, James A. Hendler: Adaptation of Plans via Annotation Verification. IEA/AIE (Vol. 1) 1988: 164-170 |