Termination of Simply Moded Logic Programs with Dynamic Scheduling


Bossi, Annalisa and Etalle, Sandro and Rossi, Sabina and Smaus, Jan-Georg (2004) Termination of Simply Moded Logic Programs with Dynamic Scheduling. ACM Transactions on Computational Logic, 15 (3). pp. 470-507. ISSN 1529-3785

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract: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.
Item Type:Article
Copyright:© 2004 Association for Computing Machinery
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/48621
Official URL:https://doi.org/10.1145/1013560.1013564
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 220237