Stephen Cresswell, Alan Smaill, Julian Richardson  Home/Search
Context Related
Links: ACM DBLP | dai.ed.ac.uk/~julianr...ecp_paper.ps.gz informatik.uniulm...63cresswell.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cee.hw.ac.uk/~juli...publications (more) Homepages: J.Richardson |
Rate this article:      (best)Comment on this article |
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. 1 Introduction We are interested in the automated synthesis... (Update)
Context of citations to this paper: More
.... [9, 66, 33, 7, 74] Planning within a part of LL consisting only of tensor may be viewed as multiset rewriting as proposed in [96] In [19] a formalism has been given for deductively generating recursive plans in Linear Logic. This advancement is a step further to more general...
...Unfortunately, the algorithm Jacopin proposes for proof search is very inecient and belongs to the class of brute force methods. In [6] a formalism has been given for deductively generating recursive plans in Linear Logic. This advancement is a step further to more general...
Cited by: More
Plans as Formulae with a Non-commutative Logical Operator -.. - Kahramanogullari (Correct)
Resource-Conscious AI Planning with Conjunctions and Disjunctions - Küngas (2002) (Correct)
Linear Logic Programming for AI Planning - Küngas (2002) (Correct)
Active bibliography (related documents): More All
0.5: Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (Correct)
0.3: A Unified View of Program Schemas and Proof Methods - Flener, Richardson (Correct)
0.3: Synthesis of Induction Orderings for Existence Proofs - Dieter Hutter German (1994) (Correct)
Similar documents based on text: More All
0.2: System Description: Proof Planning in - Higher-Order Logic With (Correct)
0.1: Lakatos and Machine Creativity - Alison Pease And (2002) (Correct)
0.1: Automating Changes of Data Type in Functional Programs - Richardson (1995) (Correct)
Related documents from co-citation: More All
3: Fast planning through planning graph analysis - Blum, Furst - 1995
3: Theoretical Computer Science (context) - Girard - 1987
2: Disjunction in Resource-Oriented Deductive Planning - Br, olldobler et al. - 1994
BibTeX entry: (Update)
S Cresswell, A Smaill and J Richardson, 1999. Deductive Synthesis of Recursive Plans in Linear Logic. Proceedings of the Fifth European Conference on Planning. http://citeseer.ist.psu.edu/cresswell99deductive.html More
@inproceedings{ cresswell99deductive,
author = "Stephen Cresswell and Alan Smaill and Julian Richardson",
title = "Deductive Synthesis of Recursive Plans in Linear Logic",
booktitle = "{ECP}",
pages = "252-264",
year = "1999",
url = "citeseer.ist.psu.edu/cresswell99deductive.html" }
Citations (may not include all citations):891 STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971 DBLP
440 The Art of Prolog (context) - Sterling, Shapiro
168 Rippling: A heuristic for guiding inductive proofs - Bundy, Stevens et al. - 1993
111 A deductive solution for plan generation (context) - Bibel - 1986 ACM DBLP
88 Linear logic: its syntax and semantics - Girard - 1995
23 How to clear a block: a theory of plans (context) - Manna, Waldinger - 1986 ACM DBLP
16 Programming in Martin-Lof Type Theory (context) - Nordstrom, Petersson et al. - 1990
16 Disjunction in resource-oriented deductive planning (context) - Bruning, Holldobler et al. - 1993 ACM DBLP
14 Linear deductive planning (context) - Groe, Holldobler et al. - 1996 DBLP
11 Extensions to a Generalization Critic for Inductive Proof - Ireland, Bundy - 1996 ACM DBLP
11 Deduction based refinement planning - Stephan, Biundo - 1996
6 Generating plans in linear logic II: A geometry of conjuncti.. (context) - Masseron - 1993
6 Classical AI planning as theorem proving: The case of a frag.. - Jacopin - 1993
3 Using middle-out reasoning to control the synthesis of tail-.. - Hesketh, Bundy et al. - 1992 ACM DBLP
2 Revised version of Imperial College Technical Report DoC (context) - Abramsky, of et al. - 1993
1 Generating plans in linear logic I: Actions and proofs (context) - Masseron, Tollu et al. - 1993
Documents on the same site (http://www.cee.hw.ac.uk/~julianr/publications.html): More
Proof Planning with Schema Frameworks - Richardson (1998) (Correct)
Applying Adversarial Planning Techniques to Go - Willmott, Richardson, Bundy.. (1999) (Correct)
Proofs About Lists Using Ellipsis - Bundy, Richardson (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC