Gert Groe, Ste#en Holldobler, and Josef Schneeberger. Linear deductive planning. Journal of Logic and Computation,6(2):233--262, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to the Frame Problem [12] which appeal to non classical logics, namely, linearized versions of, respectively, the connection method [1, 2] and Gentzen s sequent calculus [11] The a#nity of the Fluent Calculus and these two formalisms has been emphasized by several formal comparison results. In [5], for example, the three approaches have been proved to deliver equivalent solutions to a resource sensitive variant of Strips planning [4] Yet the Fluent Calculus possesses a feature by which it stands out against the two other frameworks: It stays entirely within classical logic. In this ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear Deductive Planning. J. of Logic and Computation, 6(2):233--262, 1996.

....inherently resource sensitive. We can use a logical planning framework while retaining a STRIPS like approach to dealing with the frame problem. The use of linear logic in planning was first explored by Masseron et al. 15] and [14] and has also been considered by Jacopin [12] and Grosse et al. [8]. However, authors have mainly concentrated on adequacy for simple STRIPS like plan representations. We think its true potential in planning lies in using its full expressiveness. In this paper, we extend linear logic with an appropriate form of induction that allows us to reason about recursive ....

....is less redundant than ours, but more awkward to extend to a larger fragment of the logic. Problems involving disjunction are covered by the representation but not by the geometric argument relating proofs to plans. A procedure for proof search using the conjunctive fragment is given in [12] [8] makes clear the close relationship between their technique of planning with equational resolution, Bibel s linear connection method [2] and linear logic. Techniques based on the connection method have been used both as deductive planners and as linear logic theorem provers. 6.2 Recursive ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. Journal of Logic and Computation, 6(2):233--262, 1996.

....to compute with multisets instead of sets. Furthermore, the concept of resources and multisets are more adequate solutions to the frame problem [29] The three recent approaches [7, 37, 28] are equivalent for planning problems where the condition and effect of actions are multisets of facts [48, 22]. In [23] it is also shown that the equational logic approach can handle database transactions as well as objects and methods in much the same way as database transactions as well as objects and methods are handled in [44] and [1] respectively. It has turned out that inheritance of methods comes ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear Deductive Planning. Logic and Computation, 1995. (To appear).

....represent resources more adequately than sets and, moreover, it is more efficient to compute with multisets instead of sets. These three so called resource oriented approaches [2, 11, 8] are equivalent for planning problems where the conditions and effects of actions are multisets of facts [6]. This result does not only provide a standard semantics for fragments of the linear logic and the linear connection method, it also suggests that resources can be treated i.e. the question of how to express that a particular fact which is not affected by an action continues to hold after ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. Journal of Logic and Computation, 1995. (to appear).

.... the execution of p in s leads to the fulfillment of g should be a logical consequence of an appropriate axiomatization of situations, actions and causality (see [10, 11] This problem was extensively studied for simple plans consisting of sequences or partial orderings of primitive actions (e.g. [12, 2]) However less attention was given to complex plans including conditional and recursive actions as well as non deterministic choice operators (see Section Relation to Other Approaches . This paper is organized as follows. First, we demonstrate the need for complex plans by a simple example, ....

....White translated Golog into an extended linear logic [16] While the transformation seems to be quite straightforward, the variant of linear logic used by White is non standard. On the other hand, there is a close relation between the fluent calculus and linear logic as formally shown in [2]. Since the fluent calculus admits a standard and well understood semantics it seems to be preferable to the corresponding fragments of linear logic. 8 Open Problems and Future Research We intend to use the planning language presented in this paper to program autonomous robots. In order to do so ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. Journal of Logic and Computation, 6(2):233--262, 1996.

.... In the sequel we will present the fluent calculus based on [15] as it has turned out that this approach admits a standard semantics and is equivalent to the linear connection method developed in [2] and the linear logic approach developed in [19] both of which do not have a standard semantics [10]. 4 3.1 Representing Fluents and Situations As a first step towards an equational logic approach to planning we have to choose an appropriate representation for fluents and situations. As already mentioned we like to represents fluents by resources and, consequently, situations are represented ....

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. Journal of Logic and Computation, 6(2):233--262, 1996.

No context found.

Gert Groe, Ste#en Holldobler, and Josef Schneeberger. Linear deductive planning. Journal of Logic and Computation,6(2):233--262, 1996.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. In Journal of Logic and Computation, volume 6 (2), pages 233--262. 1996.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. In Journal of Logic and Computation, volume 6 (2), pages 233--262. 1996.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. In Journal of Logic and Computation, volume 6 (2), pages 233--262. 1996.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear deductive planning. In Journal of Logic and Computation, volume 6 (2), pages 233--262. 1996.

No context found.

Gert Groe, Ste#en Holldobler, and Josef Schneeberger. Linear deductive planning. Journal of Logic and Computation,6(2):233--262, 1996.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear Deductive Planning. J. of Logic and Computation, 1995.

No context found.

G. Groe, S. Holldobler, and J. Schneeberger. Linear Deductive Planning. Logic and Computation, 1994. (To appear).

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