Deductive Synthesis of Recursive Plans in Linear Logic
- Cite this paper as:
- Cresswell S., Smaill A., Richardson J. (2000) Deductive Synthesis of Recursive Plans in Linear Logic. In: Biundo S., Fox M. (eds) Recent Advances in AI Planning. ECP 1999. Lecture Notes in Computer Science, vol 1809. Springer, Berlin, Heidelberg
Linear logic has previously been shown to be suitable for describing and deductively solving planning problems involving conjunction and disjunction. We introduce a recursively defined datatype and a corresponding induction rule, thereby allowing recursive plans to be synthesised. In order to make explicit the relationship between proofs and plans, we enhance the linear logic deduction rules to handle plans as a form of proof term.
Unable to display preview. Download preview PDF.