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

Simple item page
dc.creatorBossi, Annalisa
dc.creatorEtalle, Sandro
dc.creatorRossi, Sabina
dc.creatorSmaus, Jan-Georg
dc.date2001-01-23
dc.date.accessioned2026-07-07T03:16:52Z
dc.date.available2026-07-07T03:16:52Z
dc.descriptionIn 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.
dc.description25 pages, long version of paper with same title at ESOP 2001
dc.identifierhttps://arxiv.org/abs/cs/0101022
dc.identifierhttp://arxiv.org/abs/cs/0101022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30517
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.1.3; D.1.6; F.3.2
dc.titleSemantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
dc.typetext

Files

Collections

arXiv