Planning in Action Formalisms based on DLs: First Results

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.

• Type: Conference
• Year: 2007
• Where: DLOG
• Authors: Maja Milicic
• Keywords: Action Formalisms, Automated Reasoning, Computational Complexity Coincides, DLOG 2007, Plan Existence Problem