Friends or Foes? An AI Planning Perspective on Abstraction and Search
暂无分享,去创建一个
[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[2] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[3] Jacob A. Abraham,et al. Property Checking via Structural Analysis , 2002, CAV.
[4] Yixin Chen,et al. Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..
[5] Hassen Saïdi,et al. Construction of Abstract State Graphs with PVS , 1997, CAV.
[6] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[7] Stephan Merz,et al. Model Checking , 2000 .
[8] Earl D. Sacerdott. Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.
[9] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[10] Jussi Rintanen. Evaluation Strategies for Planning as Satisfiability , 2004, ECAI.
[11] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[12] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[13] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[14] R. Holte. Psvn: a V Ector Representation for Production Systems Psvn: a Vector Representation for Production Systems , 1999 .
[15] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[16] Henry A. Kautz,et al. Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..
[17] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[18] Daniel Kroening,et al. Efficient Computation of Recurrence Diameters , 2003, VMCAI.
[19] Stefan Edelkamp,et al. Promela Planning , 2003, SPIN.
[20] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[21] Bernhard Nebel,et al. Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.
[22] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[23] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[24] Malte Helmert,et al. Accuracy of Admissible Heuristic Functions in Selected Planning Domains , 2008, AAAI.
[25] Drew McDermott,et al. Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..
[26] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..
[27] J. Baumgartner,et al. Enhanced diameter bounding via structural transformation , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.
[28] Anubhav Gupta,et al. Abstraction Refinement for Bounded Model Checking , 2005, CAV.
[29] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[30] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[31] Stephen F. Smith,et al. Using Decision Procedures Efficiently for Optimization , 2007, ICAPS.
[32] Jj Org Hoomann. Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks , 2003 .
[33] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[34] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[35] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[36] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[37] Jonathan Schaeffer,et al. Pattern Databases , 1998, Comput. Intell..
[38] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.