LogiCIC/LIRa lunch talk: Thomas Bolander

On Tuesday, March 31, 2015, we will have a joint LogiCIC/LIRa lunch talk with Thomas Bolander.

Everyone is cordially invited!

Speaker: Thomas Bolander

Date and Time: Tuesday, March 31, 2015, 13:00-14:30
Venue: Science Park 107, Room F1.15

Title: Complexity Results in Epistemic Planning

Abstract. Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidable, more precisely in EXPSPACE. The plan existence problem is PSPACE-complete when the underlying graphs are trees and NP-complete when they are chains (including singletons). We also show PSPACE-hardness of the plan verification problem, which strengthens previous results on the complexity of DEL model checking.

This is joint work with Martin Holm Jensen and Francois Schwarzentruber.