Deductive synthesis of recursive plans in linear logic

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 252-264

  Cresswell, Stephen ^a   Smaill, Alan ^a   Richardson, Julian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DATA TYPE; DEDUCTIVE SYNTHESIS; LINEAR LOGIC; PLANNING PROBLEM; SYNTHESISED;

LINEAR ALGEBRA;

EID: 84943225805     PISSN: 03029743     EISSN: None     Source Type: Journal    
DOI: 10.1007/10720246_20     Document Type: Article

References (18)

1. S.Abramsky.Computational interpretations of linear logic.Theoretical Computer Science, 111:3-57, 1993.(Revised version of Imperial College Technical Report DoC 90/20).
2. W.Bibel.A deductive solution for plan generation.New Generation Computing, 4:115-132, 1986.
3. S.Brüning, S.Hölldobler, J.Schneeberger, U.Sigmund, and M.Thielscher.Disjunction in resource-oriented deductive planning.In Proceedings of the International Symposium on Logic Programming, page 670, 1993.
4. A.Bundy, A.Stevens, F.van Harmelen, A.Ireland, and A.Smaill.Rippling: A heuristic for guiding inductive proofs.Artificial Intelligence, 62:185-253, 1993.Also available from Edinburgh as DAI Research Paper No.567.
5. R.E.Fikes and N.J.Nilsson.STRIPS: A new approach to the application of theorem proving to problem solving.Artificial Intelligence, 2:189-208, 1971.
6. G.R.Ghassem-Sani and S.W.D.Steel.Recursive plans.In Proc.of the European Workshop on Planning EWSP-91, pages 53-63, St.Augustin, Germany, 1991.
7. J.-Y.Girard.Linear logic: its syntax and semantics.In J.-Y.Girard, Y.Lafont, and L.Regnier, editors, Advances in Linear Logic, number 222 in London Mathematical Society Lecture Notes Series.Cambridge University Press, 1995.
8. G.Grofie, S.Hölldobler, and J.Schneeberger.Linear deductive planning.Journal of Logic and Computation, 6(2):233-262, 1996.
9. J.Hesketh, A.Bundy, and A.Smaill.Using middle-out reasoning to control the synthesis of tail-recursive programs.In Deepak Kapur, editor, 11th International Conference on Automated Deduction, pages 310-324, Saratoga Springs, NY, USA, June 1992.Published as Springer Lecture Notes in Artificial Intelligence, No 607.
10. J.S.Hodas and D.Miller.Logic programming in a fragment of intuitionistic linear logic.Information and Computation, 110(2):327-365, 1994.Extended abstract in the Proceedings of the Sixth Annual Symposium on Logic in Computer Science, Amsterdam, July 15-18, 1991.
11. A.Ireland and A.Bundy.Extensions to a Generalization Critic for Inductive Proof.In M.A.McRobbie and J.K.Slaney, editors, 13th International Conference on Automated Deduction, pages 47-61.Springer-Verlag, 1996.Springer Lecture Notes in Artificial Intelligence No.1104.Also available from Edinburgh as DAI Research Paper 786.
12. E.Jacopin.Classical AI planning as theorem proving: The case of a fragment of linear logic.In AAAI Fall Symposium on Automated Deduction in Nonstandard Logics, Technical Report FS-93-01, pages 62-66.AAAI Press Publications, Palo Alto, 1993.
13. Z.Manna and R.Waldinger.How to clear a block: A theory of plans.Journal of Automated Reasoning, 3(4):343-377, 1986.
14. M.Masseron.Generating plans in linear logic II: A geometry of conjunctive actions.Theoretical Computer Science, 113:371-375, 1993.
15. M.Masseron, C.Tollu, and J.Vauzeilles.Generating plans in linear logic I: Actions and proofs.Theoretical Computer Science, 113(2):349-371, 1993.
16. B.Nordström, K.Petersson, and J.Smith.Programming in Martin-Löf Type Theory.Oxford University Press, 1990.
17. W.Stephan and S.Biundo.Deduction based renement planning.In B.Drabble, editor, Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pages 213-220.AAAI Press, 1996.
18. L.Sterling and E.Shapiro.The Art of Prolog.MIT Press, Cambridge, MA, second edition, 1994