EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||
|
Bossi, A. and Cocco, N. and Etalle, S. and Rossi, S.
(2004)
Declarative Semantics of Input Consuming Logic Programs.
In:
Program Development in Computational Logic.
Springer-Verlag, Berlin, pp. 90-114.
ISBN 3-540-22152-2
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-25951-0_4 AbstractMost logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe dynamic scheduling while abstracting from the technical details. We review and compare the different proposals given in related work for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||