Complexity of Planning in Action Formalisms Based on Description Logics

Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We prove that the plan existence problem is decidable for actions described in fragments of ALCQIO. More precisely, we show that its computational complexity coincides with the one of projection for DLs between ALC and ALCQIO if operators contain only unconditional post-conditions. If we allow for conditional postconditions, the plan existence problem is shown to be in 2-ExpSpace.

• Type: Conference
• Year: 2007
• Where: LPAR
• Authors: Maja Milicic
• Keywords: Action Formalisms, Artificial Intelligence, Computational Complexity Coincides, LPAR 2007, Plan Existence Problem