Mikkel Birkegaard Andersen, Thomas Bolander & Martin Holm Jensen:
Don't plan for the unexpected: Planning based on plausibility models.
Logique et Analyse.
To appear.
Mikkel Birkegaard Andersen, Thomas Bolander & Martin Holm Jensen (2012):
Conditional epistemic planning.
In: Logics in Artificial Intelligence.
Springer,
pp. 94–106,
doi:10.1007/978-3-642-33353-8_8.
Guillaume Aucher (2012):
DEL-sequents for regression and epistemic planning.
Journal of Applied Non-Classical Logics 22(4),
pp. 337–367,
doi:10.1080/11663081.2012.736703.
Guillaume Aucher & Thomas Bolander (2013):
Undecidability in Epistemic Planning.
In: IJCAI,
pp. 27–33.
Available at https://hal.inria.fr/hal-00824653.
Alexandru. Baltag & Larry Moss (2004):
Logics for epistemic programs.
Synthese 139,
pp. 165–224,
doi:10.1023/B:SYNT.0000024912.56773.5e.
Thomas Bolander & M. Birkegaard Andersen (2011):
Epistemic planning for single and multi-agent systems.
Journal of Applied Non-Classical Logics 21(1),
pp. 9–34,
doi:10.3166/jancl.21.9-34.
Blai Bonet (2010):
Conformant plans and beyond: Principles and complexity.
Artificial Intelligence. 174(3-4),
pp. 245–269,
doi:10.1016/j.artint.2009.11.001.
Daniel Bryce, Subbarao Kambhampati & David E. Smith (2006):
Planning Graph Heuristics for Belief Space Search.
Journal of Artificial Intelligence Research 26,
pp. 35–99,
doi:10.1613/jair.1869.
Alessandro Cimatti & Marco Roveri (2000):
Conformant Planning via Symbolic Model Checking.
Journal of Artificial Intelligence Research 13,
pp. 305–338,
doi:10.1613/jair.774.
Alessandro Cimatti & Marco Roveri (2011):
Conformant Planning via Symbolic Model Checking.
CoRR abs/1106.0252.
Available at http://arxiv.org/abs/1106.0252.
Alessandro Cimatti, Marco Roveri & Piergiorgio Bertoli (2004):
Conformant planning via symbolic model checking and heuristic search.
Artificial Intelligence 159(1-2),
pp. 127–206,
doi:10.1016/j.artint.2004.05.003.
Hans van Ditmarsch, Wiebe van der Hoek & Barteld Kooi (2007):
Dynamic epistemic logic.
Springer,
doi:10.1007/978-1-4020-5839-4.
R. Fagin, J. Halpern, Y. Moses & M. Vardi (1995):
Reasoning about knowledge.
MIT Press,
Cambridge, MA, USA.
R. Fagin, J. Y. Halpern, Y. Moses & M. Y. Vardi (1997):
Knowledge-based programs.
Distributed Computing 10(4),
pp. 199–225,
doi:10.1007/s004460050038.
Patrik Haslum & Peter Jonsson (1999):
Some Results on the Complexity of Planning with Incomplete Information.
In: ECP 1999,
pp. 308–318,
doi:10.1007/10720246_24.
Tao Jiang & B. Ravikumar (1991):
A note on the space complexity of some decision problems for finite automata.
Information Processing Letters 40,
pp. 25–31,
doi:10.1016/S0020-0190(05)80006-7.
Jon Kleinberg & Éva Tardos (2005):
Algorithm Design.
Addison-Wesley.
Jérôme Lang & Bruno Zanuttini (2012):
Knowledge-Based Programs as Plans - The Complexity of Plan Verification.
In: ECAI 2012,
pp. 504–509,
doi:10.3233/978-1-61499-098-7-504.
Martin Lange (2006):
Model checking propositional dynamic logic with all extras.
Journal of Applied Logic 4,
pp. 39–49,
doi:10.1016/j.jal.2005.08.002.
Benedikt Löwe, Eric Pacuit & Andreas Witzel (2011):
DEL planning and some tractable cases.
In: LORI 2011.
Springer,
pp. 179–192,
doi:10.1007/978-3-642-24130-7_13.
Héctor Palacios & Hector Geffner (2006):
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes).
In: AAAI 2006,
pp. 900–905.
Available at http://www.aaai.org/Library/AAAI/2006/aaai06-142.php.
Pere Pardo & Mehrnoosh Sadrzadeh (2013):
Strong Planning in the Logics of Communication and Change.
In: Declarative Agent Languages and Technologies X.
Springer,
pp. 37–56,
doi:10.1007/978-3-642-37890-4_3.
Rohit. Parikh & R. Ramanujam (1985):
Distributed Processes and the Logic of Knowledge.
In: Proceedings of Conference on Logic of Programs.
Springer-Verlag,
London, UK,
pp. 256–268,
doi:10.1007/3-540-15648-8_21.
Philippe Schnoebelen (2003):
The Complexity of Temporal Logic Model Checking.
In: Philippe Balbiani, Nobu-Yuki Suzuki, Frank Wolter & Michael Zakharyaschev: AiML 2002.
King's College Publication,
Toulouse, France,
pp. 393–436.
Available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Sch-aiml02.pdf.
Invited paper.
Larry J Stockmeyer & Albert R Meyer (1973):
Word problems requiring exponential time (Preliminary Report).
In: STOC 1973.
ACM,
pp. 1–9,
doi:10.1145/800125.804029.
Yanjing Wang & Qinxiang Cao (2013):
On axiomatizations of public announcement logic.
Synthese 190,
pp. 103–134,
doi:10.1007/s11229-012-0233-5.
Yanjing Wang & Yanjun Li (2012):
Not All Those Who Wander Are Lost: Dynamic Epistemic Reasoning in Navigation..
In: AiML 2012,
pp. 559–580.
Available at http://www.aiml.net/volumes/volume9/Wang-Li.pdf.