In logic programming, dynamic scheduling indicates the= feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the left-to-right one of Prolog. Input-consuming derivations were introduced to model dynamic scheduling while abstracting from the technical details. In this article, we provide a sufficient and necessary criterion for termination of input-consuming derivations of simply moded logic programs. The termination criterion we propose is based on a denotational semantics for partial derivations which is defined in the spirit of model theoretic semantics previously proposed for left-to-right derivations.
|Data di pubblicazione:||2004|
|Titolo:||Termination of Simply Moded Logic Programs with Dynamic Scheduling.|
|Rivista:||ACM TRANSACTIONS ON COMPUTATIONAL LOGIC|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1145/1013560.1013564|
|Appare nelle tipologie:||2.1 Articolo su rivista |
File in questo prodotto:
|TOCL04.pdf||Documento in Post-print||Accesso chiuso-personale||Riservato|