Jan-Georg Smaus, Pat M. Hill, and Andy M. King. Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. In P. Flener, editor, Proceedings of the Eight International Workshop on Logic-Based Program Synthesis and Transformation, volume 1559 of Lecture Notes in Computer Science, pages 289--307. Springer, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....this requirement are called strongly terminating. The class of strongly terminating programs is very limited. For most logic programs, it is necessary for termination to require a certain degree of instantiation of an atom before it can be selected. This can be achieved using delay declarations [2, 16, 17, 18, 19, 22, 23]. The problem is that, depending on what kind of delay declarations and selection rule are used, it is often not possible to pin down the size of the selected atom, since this size may depend on the resolution of other atoms in the query that are Formerly: University of Kent at Canterbury, ....

.... in this area have usually made speci c assumptions about the selection rule and the delay declarations, for example local selection rules [17] delay declarations that test arguments for groundness or rigidness [16, 18] or the default left to right selection rule of most Prolog implementations [19, 22, 23]. In contrast, we show how previous results about LD derivations can be generalised, the only assumption about the selection rule being that derivations are input consuming. We exploit that under certain conditions, it is enough to rely on a relative decrease in the size of the selected atom. ....

[Article contains additional citation context not shown here]

J.-G. Smaus, P. M. Hill, and A. M. King. Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. In P. Flener, editor, Proceedings of LOPSTR'98, LNCS. Springer-Verlag, 1999.

....use of delay declarations and how it can be weakened. This paper is organised as follows. The next section de nes some essential concepts and notations. Section 3 introduces four concepts of modedness and typedness that are needed later. Section 4, which is based on previously published work (Smaus et al. 1999), presents the rst approach to the termination problem. Section 5, which is also based on previously published work (Smaus et al. 1998) presents the second approach. Section 6 is about errors related to built ins. Section 7 considers ways of simplifying the block declarations. Section 8 ....

....then multiple (renamed) versions of this predicate should be introduced, which may di er concerning the delay declarations and the order of atoms in clause bodies. Note that our notion of modes could easily be generalised further by assigning a mode to predicate occurrences rather than predicates (Smaus, 1999). 2.3 Types A type is a set of terms closed under instantiation (Apt Luitjes, 1995; Boye, 1996) The variable type is the type that contains variables and hence, as it is closed under instantiation, all terms. Any other type is a non variable type. A type is a ground type if it contains only ....

[Article contains additional citation context not shown here]

Smaus, J.-G., Hill, P. M., & King, A. M. (1999). Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. Pages 289-307 of: Flener, P. (ed), Proceedings of the 8th international workshop on logic-based program synthesis and transformation. LNCS. Springer-Verlag.

....program is well fed with respect to these modes and types. Finding the free and bound positions, as well as the decreasing position used to prove robustness, should be done by the tool. As already indicated, these choices are very constrained anyway, which suggests that this should be feasible. In [16] we discuss how to prevent errors related to built ins, in particular arithmetic built ins. Another interesting issue is how achieving multiple modes using block declarations affects the efficiency of programs. Acknowledgements We thank the anonymous referees for their helpful suggestions and ....

J.-G. Smaus, P. M. Hill, and A. King. Preventing instantiation errors and loops for logic programs with several modes using block declarations. In Pierre Flener, editor, Pre-proceedings of LOPSTR. University of Manchester, 1998. Extended abstract.

.... By applying abstract interpretation techniques, progress was made on the control generation problem [3, 14, 15] ffl A number of easily checked criteria were found that ensure the correct termination behaviour of programs in the presence of control declarations such as the block of SICStus Prolog [18, 19]. ffl New compile time and run time methods for deciding when parallel evaluation is profitable [12, 16] 3 Determinacy and methods for its detection In spite of the importance of determinacy in providing efficient implementations, there was a lack of consensus in the literature as to its precise ....

....to the themes of the project and we decided to investigate this further. This work led to two papers: Termination of Logic Programs with block Declarations Running in Several Modes [19] and Preventing Instantiation Errors and Loops for Logic Programs with Several Modes Using block Declarations [18] both by Smaus, Hill, and King. The papers show how type and instantiation errors related to built ins can be avoided, and how normal termination behaviour can be ensured. Three features are distinctive of this work: a) we assume that predicates can be used in several modes (previous results were ....

[Article contains additional citation context not shown here]

J.-G. Smaus, P. Hill, and A. King. Preventing instantiation errors and loops for logic programs with several modes using block declarations. In To appear in Logic Program Synthesis and Transformation, 1998. http://www.cs.ukc.ac.uk/pubs/1998/585.

No context found.

Jan-Georg Smaus, Pat M. Hill, and Andy M. King. Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. In P. Flener, editor, Proceedings of the Eight International Workshop on Logic-Based Program Synthesis and Transformation, volume 1559 of Lecture Notes in Computer Science, pages 289--307. Springer, 1999.

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