Gerd Groe, Steen Holldobler, and Josef Schneeberger. Linear Deductive Planning. Journal of Logic and Computation, 6(2):233-262, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....as addressing further aspects. In this paper, we present the Fluent Calculus as a speci cation language and system for robots which meets the requirement to address all of the aspects listed above in a uniform way. The calculus roots in the logic programming formalism of [21] which in [18] has been proved equivalent to approaches to the Frame Problem that appeal to non classical logics, namely, linearized versions of the connection method [3] and Gentzen s sequent calculus [37] resp. All three frameworks have been designed especially to address not only the representational but ....

Gerd Groe, Steen Holldobler, and Josef Schneeberger. Linear Deductive Planning. Journal of Logic and Computation, 6(2):233-262, 1996.

....list l 3 contains all elements in l 2 but those in l 1 . 44 9 Summary and Discussion The historical development of the Fluent Calculus is tightly connected with several attempts to solve the fundamental Frame Problem [39] Our calculus roots in the logic programming formalism of [20] which in [16] has been proved equivalent to approaches to the Frame Problem that appeal to non classical logics, namely, linearized versions of the connection method [3] and Gentzen s sequent calculus [34] resp. All three frameworks have been designed especially to address not only the representational but ....

Gerd Groe, Steen Holldobler, and Josef Schneeberger. Linear Deductive Planning. Journal of Logic and Computation, 6(2):233-262, 1996.

.... first one or into the application of R) 5 Detecting Termination Theorem 1 almost gives a proof theoretic treatment of Thielscher s algorithm in [14, 15] He there describes a treatment of ramification in which one first computes the direct e#ects of actions using the fluent calculus [13] by [3] this is equivalent to non modal linear logic) and then applies a rewrite system to compute the ramification. We can obtain the same e#ect by applying Theorem 1 to inferences in which A is an input situation, B an output situation, and A # ( B # is an action. However, it generalises this ....

Gerd Groe, Ste#en Holldobler, and Josef Schneeberger. Linear deductive planning. Technical Report AIDA--92--08, FG Intellektik, FB Informatik, TH Darmstadt, 1992.

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