Miller, D. Observations about using logic as a specification language. In GULP-PRODE'95 -- Joint Conference on Declarative Programming (Marina de Vietri, Salerno, Italy, September 1995).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....be interesting to attempt to apply these ideas in related situations where aliasing is prevalent, such as # calculus or object calculi. In the linear logic literature there have been numerous hints, suggesting that substructural logic can be used to specify and reason about actions locally (e.g. [13, 21]) While this proposal was tantalyzing, it has not subsequently been developed very far, certainly not as far as a program logic for pointers. Encodings of the semantics of imperative languages, e.g. 9] are important and useful, but fall well short of program logic. The results of this paper ....

Miller, D. Observations about using logic as a specification language. In GULP-PRODE'95 -- Joint Conference on Declarative Programming (Marina de Vietri, Salerno, Italy, September 1995).

.... us with logics that are very expressive, for example Linear Logic (LL) Gir87] that we can exploit for increasing the expressiveness of logic languages in such a way that logic can be used to make statements about computation by encoding states and transitions directly using formulas and proof [Mil95] We believe it is possible to use Linear Logic to model a system involving dynamic agents [Del97] Thus, our specification environment will allow us to transform a real problem into a logic program, executable in a traditional logic programming setting, but this problem could also have a formal ....

....KG96] have been realized. Directly executing an agent specification (expressed as a logic formula OE) means both generating a model M for OE (if OE represents some property of the agent) or giving a proof of OE (if OE encodes the behaviour of the agent, as in a logic programming setting) Miller [Mil95] defines the first approach computation as model and the second one computation as deduction. An example of the first kind of direct execution is [Fis94] whereas we have never heard of using the second approach for giving a directly executable agent specification. As far as translation is ....

D. Miller. Observations about Using Logic as a Specification Language. In Proc. of GULP--PRODE 1995: Joint Conference on Declarative Programming, pages 11--14, Marina di Vietri, Italy, September 1995. Invited paper. 21

....the usual approach to the frame problem. The first is to use proof search to directly model the evolution of state, rather than to use logic to prove theorems about the state change. Dale Miller describes this as the paradigm of computation as deduction rather than that of computation as model [18]; however, it is probably more accurately described as computation as proof search (see [11] The second modification will be that our base logic will be linear logic and not either classical logic or some nonmonotonic extension of classical logic. It has been observed many times that linear ....

....classical logic or some nonmonotonic extension of classical logic. It has been observed many times that linear logic, in a sense, solves the frame problem . For example, Miller says that linear logic provides flexible ways to handle state, state transitions, and simple concurrency primitives [18], and there are similar remarks in [11] Typically, remarks such as have a very modest import: they mean that linear logic can handle the simple task of updating a single element of the world, leaving everything else unchanged. They also do not address any issues of computational efficiency. ....

Dale Miller, "Observations About Using Logic as a Specification Language ", GULP-PRODE'95 - Joint Conference on Declarative Programming, Marina di Vietri, Salerno, Italy, 11-14 September 1995.

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