Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in , a large number of them are actually input-consuming.
In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one.
Computational Logic — CL 2000Computational Logic — CL 2000Look
|Title of host publication||Computational logic - CL 2000 : proceedings 1st international conference, London, UK, 24-28 july, 2000|
|Editors||J.W. Lloyd, xx et al|
|Publication status||Published - 2000|
|Name||Lecture Notes in Computer Science|