A new representation and associated algorithms for generalized planning

[1]  Tessa A. Lau,et al.  Sheepdog: learning procedures for technical support , 2004, IUI '04.

[2]  T. Oates,et al.  Workflow Inference : What to Do with One Example and No Semantics , 2007 .

[3]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

[4]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[5]  Robert Givan,et al.  Approximate Policy Iteration with a Policy Language Bias , 2003, NIPS.

[6]  Manuela M. Veloso,et al.  DISTILL: Learning Domain-Specific Planners by Example , 2003, ICML.

[7]  Neil Immerman,et al.  Merging example plans into generalized plans for non-deterministic environments , 2010, AAMAS.

[8]  Marco Pistore,et al.  Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..

[9]  Steven Eker,et al.  Iteration Learning by Demonstration , 2009, AAAI Spring Symposium: Agents that Learn from Human Teachers.

[10]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 2002, TOPL.

[11]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[12]  Luca Spalzzi,et al.  A Survey on Case-Based Planning , 2001 .

[13]  Andreas Podelski,et al.  Termination proofs for systems code , 2006, PLDI '06.

[14]  Nathanael Chambers,et al.  PLOW: A Collaborative Task Learning Agent , 2007, AAAI.

[15]  Manuela Veloso,et al.  Learning domain-specific planners from example plans , 2008 .

[16]  Andreas Podelski,et al.  A Complete Method for the Synthesis of Linear Ranking Functions , 2004, VMCAI.

[17]  Thomas W. Reps,et al.  Finite Differencing of Logical Formulas for Static Analysis , 2003, ESOP.

[18]  Neil Immerman,et al.  Computing Applicability Conditions for Plans with Loops , 2010, ICAPS.

[19]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[20]  Thomas A. Henzinger,et al.  Lazy abstraction , 2002, POPL '02.

[21]  Blai Bonet,et al.  Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners , 2009, ICAPS.

[22]  Paolo Traverso,et al.  Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.

[23]  R. Mooney,et al.  Explanation-Based Learning: An Alternative View , 1986, Machine Learning.

[24]  Jude W. Shavlik,et al.  Acquiring recursive and iterative concepts with explanation-based learning , 2004, Machine Learning.

[25]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[26]  Pedro M. Domingos,et al.  Programming by Demonstration Using Version Space Algebra , 2003, Machine Learning.

[27]  R. Brafman,et al.  Contingent Planning via Heuristic Forward Search witn Implicit Belief States , 2005, ICAPS.

[28]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[29]  T. Mexia,et al.  Author ' s personal copy , 2009 .

[30]  Neil Immerman,et al.  Learning Generalized Plans Using Abstract Counting , 2008, AAAI.

[31]  Zhengzhu Feng,et al.  Symbolic heuristic search for factored Markov decision processes , 2002, AAAI/IAAI.

[32]  Jorge A. Baier,et al.  Exploiting Procedural Domain Control Knowledge in State-of-the-Art Planners , 2007, ICAPS.

[33]  Hector J. Levesque,et al.  Planning with Loops , 2005, IJCAI.

[34]  Carmel Domshlak,et al.  Friends or Foes? An AI Planning Perspective on Abstraction and Search , 2006, ICAPS.

[35]  Craig A. Knoblock.  Search Reduction in Hierarchical Problem Solving , 1991, AAAI.

[36]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[37]  Hector J. Levesque,et al.  Foundations for the Situation Calculus , 1998, Electron. Trans. Artif. Intell..

[38]  Hector Muñoz-Avila,et al.  HTN-MAKER: Learning HTNs with Minimal Additional Knowledge Engineering Required , 2008, AAAI.