Michael Winikoff and James Harland. Implementation and development issues for the linear logic programming language Lygon. In Australasian Computer Science Conference, pages 563--572, February 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....may be extended or reduced thus giving rise to other logics. A number of real life problems can be naturally represented and elegantly solved via resource sensitive inferencing. Useful and computationally efficient reasoning systems have been developed employing substructural logics (for instance, [25] and [19] The organisation of this paper is as follows. Initially, we list some of the issues related to knowledge sharing and give a perspective on work carried out. In Section 2 we present combinator logics as our chosen formalism for defining a knowledge sharing framework among systems based ....

M. Winikoff and J. Harland. Implementation and Development Issues for the Linear Logic Programming Language Lygon. In Proc. 8 th Australasian Computer Science Conf., pages 562--573, Adelaide, Australia, February 1995. 8

.... 1 Introduction Due to its ability to handle resources in a finely controlled way, linear logic [13] was adopted as a proof theoretic foundation of several logic programming and specification languages in which some notions of state can be modelled, for instance Lolli [12] Forum [19] Lygon [11] and the Linear Logical Framework of [8] Besides these, some other systems were also proposed with the motivation of allowing the specification of concurrent systems, prominent examples being LO [4] and ACL [14] In this context, several authors [17, 15, 14] noticed the resemblance between ....

....asynchronous sections of proofs but also in backchaining (focusing) steps. We also believe that a concrete language based on L can be given a reasonably efficient implementation, since the control of resource sharing acquisition needed should be simpler than the I O models and improvements of [12, 11, 7] needed to handle unrestricted occurrences of the linear logic conjunctive connectives Omega (multiplicative) and (additive) The structure of the paper is the following. In Section 2 we will motivate the design of L by a analysis of the process interpretation of uniform proof search. In ....

J. Harland and M. Winikoff. Implementation and development issues for the linear logic programming language Lygon. In Proc. of the Eighteenth Australian Computer Science Conference, 1995.

.... 1 Introduction Due to its ability to handle resources in a finely controlled way, linear logic [8] is being adopted as a proof theoretic foundation of several logic programming and specification languages in which some notions of state can be modelled, for instance Lolli [7] Forum [11] Lygon [6] and the Linear Logical Framework of [5] Some other systems were also proposed with the main motivation of allowing the specification of concurrent systems, prominent examples being LO [2] and ACL [9] In this context, several authors [13, 10, 9] noticed the resemblance between the forms of ....

....namely by revealing opportunities of parallelism also in backchaining (focusing) steps. We also believe that a concrete language based on LC can be given an efficient implementation, since the control of resource sharing acquisition needed should be simpler than the I O models and improvements of [7, 6, 4] needed to handle unrestricted occurrences of Omega and . The structure of the paper is the following. In Section 2 we will motivate the design of LC by a analysis of the process interpretation of uniform proof search. In Section 4 we will present and discuss a transition systems specification ....

J. Harland and M. Winikoff. Implementation and development issues for the linear logic programming language Lygon. In Proc. of the Eighteenth Australian Computer Science Conference, 1995.

.... 1 Translating M to L proofs : 135 2 Translating L to M proofs : 149 xvii xviii Preface Early work on the implementation of Lygon was reported on at the Australasian Computer Science Conference in 1995 [149]. A (rather abridged) version of chapter 4 appeared at the International Logic Programming Symposium later that year [150] Some preliminary work on Lygon programming was presented as a poster at that conference [58] Other material on which chapter 5 is based was presented at the 1996 ....

..... As a result the implementation problems are correspondingly simpler, in that neither language needs lazy splitting 1 , and so again the problems addressed in this paper do not arise. The last class of linear logic programming languages comprises Lolli [68 70] Forum [109] and Lygon [57, 122, 149]. These languages attempt to take a large fragment 1 Actually ACL includes Omega but only in contexts which prevent lazy splitting from being needed. 4.5. DISCUSSION 155 of linear logic, implement it and show that the resulting language is expressive and useful. The notion of lazy splitting ....

Michael Winikoff and James Harland. Implementation and development issues for the linear logic programming language Lygon. In Australasian Computer Science Conference, pages 563--572, February 1995.

....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 the natural specification of certain ....

....of certain constraints such as the constraint that each edge in a graph should appear at most once in a cycle, or that an action such as shooting a loaded gun causes the gun to become unloaded. The basic features and implementation techniques used in Lygon have been explained in some detail in [19, 20]; in particular, the technique of lazy splitting is used to determine the allocation of resources to particular branches of the proof. Lygon may also be thought of as an extended version of Prolog, in which the default behaviour is that each formula must be used exactly once, and hence the ....

M. Winikoff and J. Harland. Implementation and Development Issues for the Linear Logic Programming Language Lygon. Proceedings of the Eighteenth Australasian Computer Science Conference 562-573, Adelaide, February, 1995.

.... ffl Design: The initial design is reported and developed on in [HP90, HP91, HP92] and is published in its final form in [PH94] The question of design has recently been reopened in [WH96a] 10 The Lygon Language ffl Implementation: The first stab at implementing Lygon is reported on in [WH95a] The final version of the rules for deterministic splitting of resources are published as [WH95b, WH94] The Lygon system was demonstrated at AMAST 96 [HPW96a] ffl Application: Initial ideas for applications predate the implementation [HP94] Further papers discussing applications of Lygon ....

Michael Winikoff and James Harland. Implementation and development issues for the linear logic programming language Lygon. In Australasian Computer Science Conference, pages 563--572, February 1995.

No context found.

WH95 Michael Winikoff and James Harland. Implementation and development issues for the linear logic programming language Lygon. In Australasian Computer Science Conference , 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