Deductive synthesis of recursive plans in linear logic

Cresswell, Stephen and Smaill, Alan and Richardson, Julian (1999) Deductive synthesis of recursive plans in linear logic. In: 5th European Conference on Planning (ECP 99), 1999-09-08 - 1999-09-10.

Preview

Text. Filename: strathprints001952.pdf Accepted Author Manuscript Download (216kB)| 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.

• Share and Export
  

  RIS (EndNote Online, Zotero, Ref manager, etc)RIOXX2 XMLRDF+XMLData Cite XMLEndNoteBibTeXMETSDublin CoreASCII CitationMPEG-21 DIDLHTML CitationReferOpenURL ContextObject in SpanEP3 XMLMODSRDF+N3RefWorksRDF+N-TriplesMultiline CSVSimple MetadataOpenURL ContextObjectJSONAtom
• Item metadata

  Item type:	Conference or Workshop Item(Paper)
  ID code:	1952
  Dates:	Date Event 8 September 1999 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Strathprints Administrator
  Date deposited:	06 Nov 2006
  Last modified:	12 Dec 2024 16:08
  URI:	https://strathprints.strath.ac.uk/id/eprint/1952