Negation and control in Prolog
Negation and control in Prolog
Handbook of theoretical computer science (vol. B)
The Go¨del programming language
The Go¨del programming language
Moded flat GHC and its message-oriented implementation technique
New Generation Computing
Modular termination proofs for logic and pure PROLOG programs
Advances in logic programming theory
From logic programming to Prolog
From logic programming to Prolog
Constraint logic programming with dynamic scheduling: a semantics based on closure operators
Information and Computation
Proving termination of input-consuming logic programs
Proceedings of the 1999 international conference on Logic programming
Communications of the ACM
On the Unification Free Prolog Programs
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed to a fixed selection rule such as the left-to-right one of Prolog. This has applications e.g. in parallel programming. A mechanism to control dynamic scheduling is provided in existing languages in the form of delay declarations. Input-consuming derivations were introduced to describe dynamic scheduling while abstracting from the technical details. In this paper, we first formalise the relationship between delay declarations and input-consuming derivations, showing in many cases a one-to-one correspondence. Then, we define a model-theoretic semantics for input-consuming derivations of simply-moded programs. Finally, for this class of programs, we provide a necessary and sufficient criterion for termination.