Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
From logic programming to Prolog
From logic programming to Prolog
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination of Logic Programs with block Declarations Running in Several Modes
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Semantics of well-moded input-consuming logic programs
Computer Languages
| Hi-index | 0.01 |
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 [5], 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.