Semantics of Well-Moded Input-Consuming Programs

Semantics of well-moded input-consuming logic programs

Properties of Input-Consuming Derivations

We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We consider the class of nicely-moded programs and queries. We show that for these programs a weak version of the well-known switching lemma holds also for inpu...

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling

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 declaration...

Semantics of Input-Consuming Logic Programs

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 sy...

Declarative Semantics of Input Consuming Logic Programs

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 ...