Planning Graphs and Knowledge Compilation
暂无分享,去创建一个
[1] Bernhard Nebel,et al. On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..
[2] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[3] Bart Selman,et al. Knowledge compilation and theory approximation , 1996, JACM.
[4] David E. Smith,et al. Conditional Effects in Graphplan , 1998, AIPS.
[5] Jürg Kohlas,et al. Propositional Information Systems , 1999, J. Log. Comput..
[6] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[7] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[8] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[9] Ronen I. Brafman. On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach , 2001, J. Artif. Intell. Res..
[10] Jussi Rintanen,et al. A Planning Algorithm not based on Directional Search , 1998, KR.
[11] Judea Pearl,et al. Symbolic Causal Networks , 1994, AAAI.
[12] Stuart J. Russell,et al. Approximating Optimal Policies for Partially Observable Stochastic Domains , 1995, IJCAI.
[13] Ronen I. Brafman,et al. Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..
[14] Sheila A. McIlraith,et al. Theorem Proving with Structured Theories , 2001, IJCAI.
[15] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[16] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[17] Subbarao Kambhampati,et al. Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.
[18] Adnan Darwiche,et al. Utilizing Knowledge-Base Semantics in Graph-Based Algorithms , 1996, AAAI/IAAI, Vol. 1.
[19] Alfredo Milani,et al. DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph , 2000, AIPS.
[20] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[21] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[22] Alvaro del Val. A New Method for Consequence Finding and Compilation in Restricted Languages , 1999, AAAI/IAAI.
[23] Rina Dechter,et al. Resolution versus Search: Two Strategies for SAT , 2000, Journal of Automated Reasoning.
[24] David E. Smith,et al. Conformant Graphplan , 1998, AAAI/IAAI.
[25] Pierre Marquis,et al. Consequence Finding Algorithms , 2000 .
[26] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[27] David E. Smith,et al. Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.
[28] Fahiem Bacchus,et al. Generalizing GraphPlan by Formulating Planning as a CSP , 2003, IJCAI.
[29] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[30] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[31] Marco Pistore,et al. Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..
[32] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[33] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[34] Marco Cadoli,et al. A Survey on Knowledge Compilation , 1997, AI Commun..
[35] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.