Deductive Synthesis of Recursive Plans in Linear Logic

  • Stephen Cresswell
  • Alan Smaill
  • Julian Richardson
Conference paper

DOI: 10.1007/10720246_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1809)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Stephen Cresswell
    • 1
  • Alan Smaill
    • 1
  • Julian Richardson
    • 1
  1. 1.Division of InformaticsUniversity of EdinburghEdinburghU.K.

Personalised recommendations