Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Deductive synthesis of recursive plans in linear logic

Cresswell, S. and Smaill, A. and Richardson, J. (1999) Deductive synthesis of recursive plans in linear logic. In: 5th European Conference on Planning (ECP 99), 1999-09-08 - 1999-09-10, Durham, England.

[img]
Preview
PDF (strathprints001952.pdf)
Download (230Kb) | Preview

    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.

    Item type: Conference or Workshop Item (Paper)
    ID code: 1952
    Keywords: linear logic, planning systems, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Faculty of Science > Physics
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 06 Nov 2006
      Last modified: 19 Jul 2013 15:36
      URI: http://strathprints.strath.ac.uk/id/eprint/1952

      Actions (login required)

      View Item

      Fulltext Downloads: