Volume 6: January - December 1996

Issue 2: April 1996


Linear deductive planning

  • Linear deductive planning
  • G. Grosse1, S. Holldobler2 and J. Schneeberger3 Technische Hochschule Darmstadt, FB Informatik, FG Intellektik, Alexanderstr. 10, 64283 Darmstadt, Germany, 2Technische Universitat Dresden, Fachgebiet Wissensverarbeitung, Fakultat Informatik, 01062 Dresden, Germany and 3Bayerisches Forschungszentrum fur Wissensbasierte Systeme (FORWISS), Forschungsgruppe Wissenserwerb, AM Weichselgarten 7, 91058 Erlangen, Germany


    Recently, three approaches to deductive planning were developed which solve the technical frame problem without the need to state frame axioms explicitly. These approaches are based on the linear connection method, an equational Horn logic, and linear logic. At first glance these approaches seem to be very different. In the linear connection method a syntactical condition - each literal is connected at most once - is imposed on proofs. In the equational logic approach situations and plans are represented as terms and SLDE-resolution is applied as an inference rule. The linear logic approach is a Gentzen-style proof system without weakening and contraction rules. On second glance, however, and as a consequence of the results rigorously proved in this paper, it will turn out that the three approaches are equivalent. They are based on the very same idea that facts about a situation are taken as resources which can be consumed and produced.

    Keywords: Equational logic programming, linear connection method, linear logic, frame problem.

    Pages: 233 - 262

    Part of the OUP Journal of Logic and Computation WWW service

    General Information

    Click here to register with OUP.

    This page is maintained by OUP admin

    Last updated 15 Jul 96

    Part of the OUP Journals World Wide Web service.

    Copyright Oxford University Press, 1996