Generalized Planning

  2010 (3)
A Correctness Result for Reasoning about One-Dimensional Planning Problems Hu, Y.; and Levesque, H. J. In Proc. of The Twelfth International Conference on The Principles of Knowledge Representation and Reasoning, 2010.
 [php/kr/kr2010/paper/view/1270]Link   bibtex mark as read
Computing Applicability Conditions for Plans with Loops Srivastava, S.; Immerman, N.; and Zilberstein, S. In Proc. of ICAPS, 2010.
bibtex mark as read
Merging Example Plans into Generalized Plans for Non-deterministic Environments Srivastava, S.; Immerman, N.; and Zilberstein, S. In Proc. of AAMAS, 2010.
bibtex mark as read
  2009 (10)
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners Bonet, B.; Palacios, H.; and Geffner, H. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners Revisited Baier, J. A.; Fritz, C.; Bienvenu, M.; and McIlraith, S. A. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Challenges in Finding Generalized Plans Srivastava, S.; Immerman, N.; and Zilberstein, S. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Deductive Formation of Recursive Workflows Forth, J.; and Waldinger, R. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
On Pebble Motion on Graphs and Abstract Multi-robot Path Planning Surynek, P. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
P^2 : A Baseline Approach to Planning with Control Structures and Programs Petrick, R. P.A. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Partial Observability, Quantification, and Iteration for Planning Goldman, R. P. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Planning with Loops: Some New Results Hu, Y.; and Levesque, H. J. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Solving High-Level Planning Programs Giacomo, G. D.; Patrizi, F.; and Sardina, S. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
Web Service Composition via the Customization of Golog Programs with User Preferences Sohrabi, S.; Prokoshyna, N.; ; and McIlraith, S. A. In Proceedings of the ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control. September 20th, 2009, Thessaloniki, Greece, 2009.
bibtex mark as read
  2008 (3)
Foundations of Generalized Planning Srivastava, S.; Immerman, N.; and Zilberstein, S. Technical Report UM-CS-2008-039, Dept. of Computer Science, Univ. of Massachusetts, Amherst, . 2008.
bibtex mark as read
Learning Generalized Plans Using Abstract Counting Srivastava, S.; Immerman, N.; and Zilberstein, S. In Proc. of AAAI, page 991-997, 2008.
 [html#srivastavaiz08]Paper   bibtex mark as read
Using Abstraction for Generalized Planning Srivastava, S.; Immerman, N.; and Zilberstein, S. International Symposium on AI and Mathematics, . 2008.
bibtex mark as read
  2007 (3)
Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners Baier, J. A.; Fritz, C.; and McIlraith, S. A. In Proc. of ICAPS, page 26-33, 2007.
 [html#baierfm07]Paper   bibtex mark as read
LoopDISTILL: Learning Domain-Specific Planners from Example Plans Winner, E.; and Veloso, M. M. In Workshop on AI Planning and Learning, ICAPS, 2007.
bibtex mark as read
Using Abstraction for Generalized Planning Srivastava, S.; Immerman, N.; and Zilberstein, S. Technical Report 07-41, Dept. of Computer Science, Univ. of Massachusetts, Amherst, 2007.
bibtex mark as read
  2006 (1)
Termination proofs for systems code Cook, B.; Podelski, A.; and Rybalchenko, A. In Proc. of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006.
bibtex mark as read
  2005 (2)
Contingent Planning via Heuristic Forward Search with Implicit Belief States Hoffmann, J.; and Brafman, R. I. In Proc. of ICAPS, page 71-80, 2005.
 [html#hoffmannb05]Paper   bibtex mark as read
Planning with Loops Levesque, H. J. In Proc. of IJCAI, page 509-515, 2005.
 [html#levesque05]Paper   bibtex mark as read
  2003 (2)
DISTILL: Learning Domain-Specific Planners by Example Winner, E.; and Veloso, M. M. In Proc. of ICML, page 800-807, 2003.
 [html#winnerv03]Paper   bibtex mark as read
Weak, strong, and strong cyclic planning via symbolic model checking Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. Artif. Intell., 147(1-2):35-84. 2003.
 [html#cimattiprt03]Paper    [1016/s0004-3702(02)00374-0]Link   bibtex mark as read
  2002 (2)
Lazy Abstraction Henzinger, T. A.; Jhala, R.; Majumdar, R.; and Sutre, G. In Symposium on Principles of Programming Languages, 2002.
bibtex mark as read
Parametric shape analysis via 3-valued logic Sagiv, M.; Reps, T.; and Wilhelm, R. ACM Transactions on Programming Languages and Systems, 24(3):217-298. 2002.
bibtex mark as read
  2001 (1)
A Survey on Case-Based Planning Spalzzi, L. Artif. Intell. Rev., 16(1):3--36. 2001.
bibtex mark as read
  2000 (1)
Planning with Incomplete Information as Heuristic Search in Belief Space Bonet, B.; and Geffner, H. In Proc. of AIPS, page 52-61, 2000.
 [html#bonetg00]Paper   bibtex mark as read
  1999 (1)
Strong Cyclic Planning Revisited Daniele, M.; Traverso, P.; and Vardi, M. Y. In Proc. of the European Conference on Planning, page 35-48, 1999.
bibtex mark as read
  1998 (2)
Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains Cimatti, A.; Roveri, M.; and Traverso, P. In Proc. of AAAI, 1998.
bibtex mark as read
Foundations for the situation calculus Levesque, H. J.; Pirri, F.; and Reiter, R. Electronic Transactions on Artificial Intelligence, 2:159--178. 1998.
bibtex mark as read
  1997 (1)
GOLOG: A Logic Programming Language for Dynamic Domains Levesque, H. J.; Reiter, R.; Lesperance, Y.; Lin, F.; and Scherl, R. B. Journal of Logic Programming, 31. 1997.
bibtex mark as read
  1990 (1)
Acquiring Recursive and Iterative Concepts with Explanation-Based Learning Shavlik, J. W. Machine Learning, 5:39-40. 1990.
 [html#shavlik90]Paper   bibtex mark as read
  1986 (2)
CHEF: A Model of Case-Based Planning Hammond, K. In Proceedings of AAAI-86, page 267-271, 1986.
bibtex mark as read
Explanation-Based Learning: An Alternative View Dejong, G.; and Mooney, R. Mach. Learn., 1(2):145--176. 1986.
bibtex mark as read
  1972 (1)
Learning and Executing Generalized Robot Plans Fikes, R‥; Hart, P‥; and Nilsson, N‥ Technical Report 70, AI Center, SRI International, 1972.
bibtex mark as read
  1971 (1)
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving Fikes, R‥; and Nilsson, N‥ Technical Report AI Center, SRI International, 1971. SRI Project 8259
bibtex   abstract mark as read
Siddharth Srivastava
Last modified: Fri Mar 12 12:56:56 EST 2010