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. 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.
|Title of host publication||Program Development in Computational Logic|
|Editors||Maurice Bruynooghe, Kung-Kia Lau|
|Place of Publication||Berlin|
|Number of pages||25|
|Publication status||Published - Jun 2004|
|Name||Lecture Notes in Computer Science|