Knowledge-Based Programs as Plans - The Complexity of Plan Verification
暂无分享,去创建一个
[1] Jérôme Lang,et al. From knowledge-based programs to graded belief-based programs, part II: off-line reasoning , 2005, IJCAI 2005.
[2] Christer Bäckström,et al. Limits for compact representations of plans , 2011, ICAPS 2011.
[3] Jérôme Lang,et al. From Knowledge-based Programs to Graded Belief-based Programs, Part I: On-line Reasoning* , 2004, Synthese.
[4] Ronald Fagin,et al. Reasoning about knowledge , 1995 .
[5] Jussi Rintanen,et al. Complexity of Planning with Partial Observability , 2004, ICAPS.
[6] Eric Allender,et al. Complexity of finite-horizon Markov decision process problems , 2000, JACM.
[7] Andreas Herzig,et al. Action representation and partially observable planning using epistemic logic , 2003, IJCAI.
[8] Gerhard Lakemeyer,et al. Foundations for Knowledge-Based Programs using ES , 2006, KR.
[9] Hector J. Levesque,et al. All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..
[10] Riccardo Rosati,et al. On the decidability and complexity of reasoning about only knowing , 2000, Artif. Intell..
[11] Patrik Haslum,et al. Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.
[12] Ray Reiter,et al. On knowledge-based programming with sensing in the situation calculus , 2001, ACM Trans. Comput. Log..
[13] Blai Bonet,et al. Automatic Derivation of Finite-State Machines for Behavior Control , 2010, AAAI.
[14] Joseph Y. Halpern,et al. Characterizing Solution Concepts in Games Using Knowledge-Based Programs , 2006, IJCAI.
[15] Ronen I. Brafman,et al. On the Knowledge Requirements of Tasks , 1998, Artif. Intell..