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

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

2001-01-23

arxiv.org/abs/cs/0101022v1

Computer Science

Logic in Computer Science

25 pages, long version of paper with same title at ESOP 2001

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2650