Projects per year
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.
|Title of host publication||Recent Advances in AI Planning|
|Subtitle of host publication||5th European Conference on Planning, ECP’99, Durham, UK, September 8-10, 1999. Proceedings|
|Number of pages||13|
|Publication status||Published - 1999|
|Name||Lecture Notes in Computer Science|
|Publisher||Springer Berlin Heidelberg|