| M. Winikoff and J. Harland. Characterising Logic Programming Languages. Technical Report 95/26, Dept. of Computer Science, University of Melbourne, 1995. 15 |
....uses only uniform proofs, comparison with the hereditary Harroplike fragment used in Lygon is misleading: we have been concerned to consider resolution proofs of explicit occurrences of connectives. Further development of these issues is beyond the scope of this paper (although see, for example, [31]) 6 Discussion The development of the Lygon interpreter is continuing, particularly with regard to issues of optimization. There is a large and growing body of literature on optimization of logic programming languages, as well as a significant body of work on proof search in linear logic, which ....
M. Winikoff and J. Harland. Characterising Logic Programming Languages. Technical Report 95/26, Dept. of Computer Science, University of Melbourne, 1995. 15
....( a Phi b) and (a ( a Phi b) N (b ( a Phi b) are logically equivalent however the first is not a valid goal formula and does not have a goal directed proof even though the second does. For more on this sort of issue and on the general problem of designing logic programming languages see [21]. LinLog incorporates most of the optimisations noted in section 4. These optimisations are also applicable to Forum. 7 Conclusions and Further Work We have shown how to eliminate the nondeterminism associated with resource allocation in Lygon. We have also shown how to apply known permutability ....
M. Winikoff and J. Harland. Characterising logic programming languages. Technical Report 95/26, Melbourne University, 1995.
....to criterion F . Simple This is one method of insisting that atoms guide the proof search process. It is used in [Mil89] and simply requires that the right premise of the ( GammaL rule be the conclusion of an axiom rule. Left Focussed This is another method, introduced in this report [WH95a], of allowing atoms to guide the proof search process. Locally LR This is the criterion used in [PH94] for defining Lygon. Although the paper defines uniform as simple locally LR we feel that this overloading is undesirable since the two concepts are distinct. The locally LR criterion is ....
Michael Winikoff and James Harland. Characterising logic programming languages. Technical Report 95/26, Melbourne University, 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