Planning in Action Formalisms based on DLs: First Results

From International Center for Computational Logic

Toggle side column

Planning in Action Formalisms based on DLs: First Results

Maja MilicicMaja Milicic
Maja Milicic
Planning in Action Formalisms based on DLs: First Results
Proceedings of the 2007 International Workshop on Description Logics (DL2007), CEUR-WS, 2007
  • KurzfassungAbstract
    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, if post-conditions of operators are unconditional, its computational complexity coincides with the one of projection for DLs between ALC and ALCQIO.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Milicic-DL07,
  author = {Maja {Milicic}},
  booktitle = {Proceedings of the 2007 International Workshop on Description Logics ({DL2007})},
  series = {CEUR-WS},
  title = {Planning in Action Formalisms based on {DL}s: First Results},
  year = {2007},
}