N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. In Dale Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, pages 279--294, Vancouver, Canada, 1993. The MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....disjunctions in the heads of clauses [17] Secondly, this process can be applied to logics other than classical (or intuitionistic) logic. For example, a number of logic programming languages have been derived from linear logic including Lygon[11] Forum[15] LinLog [1] LO [2] Lolli [12] ACL [13], and LC [21] A popular proof search strategy is the notion of goal directed proof [16] which, roughly speaking, requires that the goal be decomposed before the program, and hence the computation uses the program as a context, and the goal as the controlling sequence of instructions. The ....

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. In Dale Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, pages 279--294, Vancouver, Canada, 1993. The MIT Press.

....simply calculate the final state and output it, rather than having to gather it up into an answer substitution, which is the case at present. 5 Other linear logic programming languages There are various other logic programming languages based on linear logic. These include LO [3] LinLog [2] ACL [17], LC [27] Lolli [14, 13] and Forum [19] LinLog is based on the idea of focusing proofs, which is an alternative formulation to one based on goal directed proofs, and some of the results of this line of work have been used to make the Lygon interpreter more efficient. However, LinLog has not, to ....

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. Proc. ILPS'93, D. Miller (ed.), 279-294, MIT Press, 1993.

....disjunctions in the heads of clauses [17] Secondly, this process can be applied to logics other than classical (or intuitionistic) logic. For example, a number of logic programming languages have been derived from linear logic including Lygon[11] Forum[15] LinLog [1] LO [2] Lolli [12] ACL [13], and LC [21] A popular proof search strategy is the notion of goal directed proof [16] which, roughly speaking, requires that the goal be decomposed before the program, and hence the computation uses the program as a context, and the goal as the controlling sequence of instructions. The ....

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. In Dale Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, pages 279--294, Vancouver, Canada, 1993. The MIT Press.

.... universal quantifiers, and negations in the bodies of clauses [3, 15] the incorporation of higher order facilities [15] and negations and disjunctions in the heads of clauses [16] as well as languages based on on linear logic (including Lygon[9] Forum[14] LinLog [1] LO [2] Lolli [10] ACL [11], and LC [25] 1 Many of these languages are based on the notion of a goal directed proof [15] which, roughly speaking, requires that the goal be decomposed before the program, and hence the computation uses the program as a context, but the goal as the controlling sequence of instructions. ....

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. In Dale Miller, editor, Logic Programming - Proceedings of the 1993 International Symposium, pages 279--294, Vancouver, Canada, 1993. The MIT Press.

....logic programming languages based on linear logic contain a variety of constructs which are not present in (pure) Prolog, thus providing novel and interesting extensions to the language. There have been various proposals for linear logic programming languages, including LO [2] Lolli [8] ACL [10], Forum [12] and Lygon [6, 7, 19, 20] In this paper we describe some novel and interesting applications of Lygon, with particular reference to graph problems, and problems which involve reasoning about actions. Such applications make particular use of Lygon s basis in linear logic, which allows ....

N. Kobayash, A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. Proceedings of the International Logic Programming Symposium, 279-294, Vancouver, October, 1993.

....general, it can be better to use the goal (G 1 Omega )N G 2 , so that not all resources need be consumed by the test. 5 Other linear logic programming languages As well as Lygon, there are various other logic programming languages based on linear logic. These include LO [2] LinLog [1] ACL [14], LC [19] Lolli [12, 11] and Forum [15] An adequate comparison of Lygon with these languages is beyond the scope of this paper. However, we emphasize the following points: i) Lygon is the result of a systematic proof theoretic analysis of linear logic with respect to the goal directed account ....

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. Proc. ILPS'93, D. Miller (ed.), 279-294, MIT Press, 1993.

....logic programming languages based on linear logic contain a variety of constructs which are not present in (pure) Prolog, thus providing novel and interesting extensions to the language. There have been various proposals for linear logic programming languages, including LO [2] Lolli [7] and ACL [8]. In this paper we describe the implementation of the language Lygon, which is based on the proof theoretic analysis of [4] This analysis identifies a fragment of linear logic for which the search strategy of goal directed, or uniform, proofs is complete. This strategy forms the conceptual ....

....neg p(a) neg p(b) # (p(a) p(a) Succeeded. Lygon ( neg p(a) neg p(b) # (p(a) p(b) Failed. 6.2.4 Other applications The semantics of N suggests that Lygon has potential to be applied to concurrent applications. This aspect of linear logic programming has been explored by [8] and [2] Further discussion of applications of Lygon and a Bin Packing example can be found in [5] In addition work on the application of Lolli to natural language processing carries over to Lygon [7] 7 Conclusions and Further Work Lygon s origins were in a proof theoretic analysis of ....

N. Kobayash, A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. Proceedings of the International Logic Programming Symposium, pages 279-294, Vancouver, October, 1993.

No context found.

N. Kobayash and A. Yonezawa. ACL - A Concurrent Linear Logic Programming Paradigm. Proc. ILPS'93, D. Miller #ed.#, 279-294, MIT Press, 1993.

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