The Complexity of Partial-Order Plan Viability Problems
暂无分享,去创建一个
[1] Xing Tan,et al. Towards tractable reasoning on temporal projection problems , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.
[2] Mark S. Boddy,et al. Reasoning About Partially Ordered Events , 1988, Artificial Intelligence.
[3] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[4] Malte Helmert,et al. A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.
[5] Susanne Biundo-Stephan,et al. Using State-Based Planning Heuristics for Partial-Order Causal-Link Planning , 2013, KI.
[6] Christian J. Muise,et al. Monitoring the Execution of Partial-Order Plans via Regression , 2011, IJCAI.
[7] Bernhard Nebel,et al. On the Computational Complexity of Temporal Projection, Planning, and Plan Validation , 1994, Artif. Intell..
[8] Peter Norvig,et al. Artificial intelligence - a modern approach, 2nd Edition , 2003, Prentice Hall series in artificial intelligence.
[9] Xing Tan. The Application of Ontologies to Reasoning with Process Modeling Formalisms , 2012 .
[10] Daniel S. Weld. AAAI-10 Classic Paper Award: Systematic Nonlinear Planning A Commentary , 2011, AI Mag..
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Subbarao Kambhampati,et al. Reviving Partial Order Planning , 2001, IJCAI.
[13] Peter Jonsson,et al. When Acyclicity Is Not Enough: Limitations of the Causal Graph , 2013, ICAPS.
[14] Ari K. Jónsson,et al. Activity Planning for the Mars Exploration Rovers , 2005, ICAPS.
[15] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .