Most 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. In this paper we review and compare the different proposals given in ,  and  for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis.
|Name||CTIT technical reports series|
|Publisher||University of Twente, Centre for Telematics and Information Technology (CTIT)|