Complexity of planning in action formalisms based on description logics

Authors:
Maja Miličić
Affiliations:
Institut für Theoretische Informatik, TU Dresden, Germany
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 9
Cited 4

Terminological reasoning is inherently intractable (research note)

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Special volume on planning and scheduling
Some Results on the Complexity of Planning with Incomplete Information

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
SAT-based planning in complex domains: concurrency, constraints and nondeterminism

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Compiling uncertainty away: solving conformant planning problems using a classical planner (sometimes)

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Integrating description logics and action formalisms: first results

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Reasoning about actions using description logics with general TBoxes

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

A description logic based situation calculus

Annals of Mathematics and Artificial Intelligence
Implementing automated robot task planning and execution based on description logic KB

SIMPAR'10 Proceedings of the Second international conference on Simulation, modeling, and programming for autonomous robots
Conjunctive query answering in the description logic SH using knots

Journal of Computer and System Sciences
A Family of Dynamic Description Logics for Representing and Reasoning About Actions

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.