Termination of simply moded logic programs with dynamic scheduling
ACM Transactions on Computational Logic · 2004
DOI: 10.1145/1013560.1013564 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Computational Logic, 2004. Verfasst von Annalisa Bossi und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 34 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Bossi, A., Etalle, S., Rossi, S., & Smaus, J. (2004). Termination of simply moded logic programs with dynamic scheduling. ACM Transactions on Computational Logic. https://doi.org/10.1145/1013560.1013564
Vancouver
Bossi A, Etalle S, Rossi S, Smaus J. Termination of simply moded logic programs with dynamic scheduling. ACM Transactions on Computational Logic. 2004. doi:10.1145/1013560.1013564
BibTeX
@article{Bossi2004,
author = {Bossi, Annalisa and Etalle, Sandro and Rossi, Sabina and Smaus, Jan-Georg},
title = {Termination of simply moded logic programs with dynamic scheduling},
journal = {ACM Transactions on Computational Logic},
year = {2004},
doi = {10.1145/1013560.1013564}
}
EUVIMED