Solving Planning Problems by Partial Deduction

Abstract We develop an abstract partial deduction method capable of solving planning problems in the Fluent Calculus. To this end, we extend “classical” partial deduction to accommodate both, equational theories and regular type information. We show that our new method is actually complete for conjunctive planning problems in the propositional Fluent Calculus. Furthermore, we believe that our approach can also be used for more complex systems, e. g. , in cases where completeness can not be guaranteed due to general undecidability.

Authors

• Helko Lehmann
• Michael Leuschel

Keywords

No keywords are indexed for this paper.