More for free: a dynamic epistemic framework for conformant planning over transition systems
暂无分享,去创建一个
Yanjing Wang | Yanjun Li | Quan Yu | Yanjing Wang | Yanjun Li | Quan Yu
[1] Yanjing Wang,et al. Achieving While Maintaining: - A Logic of Knowing How with Intermediate Constraints , 2016, ICLA.
[2] Yanjing Wang,et al. A Logic of Knowing How , 2015, LORI.
[3] Blai Bonet,et al. A Concise Introduction to Models and Methods for Automated Planning , 2013, A Concise Introduction to Models and Methods for Automated Planning.
[4] Martin Lange,et al. Model checking propositional dynamic logic with all extras , 2006, J. Appl. Log..
[5] David E. Smith,et al. Conformant Graphplan , 1998, AAAI/IAAI.
[6] Patrik Haslum,et al. Some Results on the Complexity of Planning with Incomplete Information , 1999, ECP.
[7] Yanjing Wang,et al. Not All Those Who Wander Are Lost: Dynamic Epistemic Reasoning in Navigation , 2012, Advances in Modal Logic.
[8] J. Benthem,et al. Logics of communication and change , 2006 .
[9] Lawrence S. Moss,et al. The Undecidability of Iterated Modal Relativization , 2005, Stud Logica.
[10] Piergiorgio Bertoli,et al. Strong planning under partial observability , 2006, Artif. Intell..
[11] Michael Wooldridge,et al. Tractable multiagent planning for epistemic goals , 2002, AAMAS '02.
[12] Yanjing Wang,et al. Strategically knowing how , 2017, IJCAI.
[13] Mehrnoosh Sadrzadeh,et al. Backward Planning in the Logics of Communication and Change , 2012, AT.
[14] A. Baltag,et al. Logics for epistemic programs , 2004 .
[15] Fahiem Bacchus,et al. Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..
[16] Hector Geffner,et al. Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes) , 2006, AAAI.
[17] Piergiorgio Bertoli,et al. Conformant planning via symbolic model checking and heuristic search , 2004, Artif. Intell..
[18] Wojciech Jamroga,et al. Constructive knowledge: what agents can achieve under imperfect information , 2007, J. Appl. Non Class. Logics.
[19] François Schwarzentruber,et al. Complexity Results in Epistemic Planning , 2015, IJCAI.
[20] Yanjing Wang. A logic of goal-directed knowing how , 2016, Synthese.
[21] Yanjing Wang,et al. A Dynamic Epistemic Framework for Conformant Planning , 2016, TARK.
[22] Paolo Traverso,et al. Automated planning - theory and practice , 2004 .
[23] Blai Bonet,et al. Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.
[24] Blai Bonet,et al. Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning , 2012, AAAI.
[25] Christian J. Muise,et al. Planning Over Multi-Agent Epistemic States: A Classical Planning Approach , 2015, AAAI.
[26] W. Hoek,et al. Dynamic Epistemic Logic , 2007 .
[27] Yanjing Wang,et al. On axiomatizations of public announcement logic , 2013, Synthese.
[28] Thomas Bolander,et al. Don't Plan for the Unexpected: Planning Based on Plausibility Models , 2015 .
[29] Guillaume Aucher,et al. DEL-sequents for regression and epistemic planning , 2012, J. Appl. Non Class. Logics.
[30] Thomas Bolander,et al. Epistemic and Doxastic Planning , 2014 .
[31] Fausto Giunchiglia,et al. Planning as Model Checking , 1999, ECP.
[32] Ronen I. Brafman,et al. Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..
[33] Daniel Bryce,et al. Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..
[34] Yanjun Li,et al. Tableaux for Single-Agent Epistemic PDL with Perfect Recall and No Miracles , 2015, LORI.
[35] Hector Geffner,et al. Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width , 2009, J. Artif. Intell. Res..
[36] Blai Bonet,et al. Conformant plans and beyond: Principles and complexity , 2010, Artif. Intell..
[37] Thomas Bolander,et al. Conditional Epistemic Planning , 2012, JELIA.
[38] Enrico Pontelli,et al. A New Approach to Conformant Planning Using CNF* , 2010, ICAPS.
[39] Thomas Bolander,et al. Epistemic planning for single- and multi-agent systems , 2011, J. Appl. Non Class. Logics.
[40] Éva Tardos,et al. Algorithm design , 2005 .
[41] Yanjing Wang,et al. From rules to runs: A dynamic epistemic take on imperfect information games , 2015, ArXiv.
[42] M. de Rijke,et al. Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.
[43] Marco Roveri,et al. Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..
[44] Christer Bäckström,et al. All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others , 2011, SOCS.
[45] Thomas Bolander,et al. Undecidability in Epistemic Planning , 2013, IJCAI.
[46] Quan Yu,et al. Multi-Agent Epistemic Explanatory Diagnosis via Reasoning about Actions , 2013, IJCAI.