Directed Search for Generalized Plans Using Classical Planners
暂无分享,去创建一个
Neil Immerman | Shlomo Zilberstein | Siddharth Srivastava | Tianjiao Zhang | S. Zilberstein | Siddharth Srivastava | N. Immerman | Tianjiao Zhang
[1] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[2] Blai Bonet,et al. Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners , 2009, ICAPS.
[3] Manuela Veloso,et al. Learning domain-specific planners from example plans , 2008 .
[4] Reinhard Wilhelm,et al. Parametric shape analysis via 3-valued logic , 2002, TOPL.
[5] Yuxiao Hu,et al. A Correctness Result for Reasoning about One-Dimensional Planning Problems , 2010, IJCAI.
[6] Neil Immerman,et al. Computing Applicability Conditions for Plans with Loops , 2010, ICAPS.
[7] Neil Immerman,et al. Merging example plans into generalized plans for non-deterministic environments , 2010, AAMAS.
[8] J. Shavlik. Acquiring Recursive and Iterative Concepts with Explanation-Based Learning , 1990, Machine Learning.
[9] Hector J. Levesque,et al. Planning with Loops , 2005, IJCAI.
[10] Neil Immerman,et al. A new representation and associated algorithms for generalized planning , 2011, Artif. Intell..
[11] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[12] Neil Immerman,et al. Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures , 2005, CADE.