Termination of simply moded logic programs with dynamic scheduling-Reference-Cited by-同舟云学术

Termination of simply moded logic programs with dynamic scheduling

Published:2004-07 Issue:3 Volume:5 Page:470-507
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Bossi Annalisa¹,Etalle Sandro²,Rossi Sabina¹,Smaus Jan-Georg³

Affiliation:

1. Università Ca' Foscari di Venezia, Venice, Italy

2. Universiteit Twente and CWI Amsterdam, Enschede, The Netherlands

3. Universität Freiburg, Germany

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1013560.1013564

Reference34 articles.

1. Apt K. R. 1997. From Logic Programming to Prolog. Prentice Hall London U.K.]] Apt K. R. 1997. From Logic Programming to Prolog. Prentice Hall London U.K.]]

2. Apt K. R. and Pedreschi D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory G. Levi Ed. Oxford University Press Oxford U.K. 183--229.]] Apt K. R. and Pedreschi D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory G. Levi Ed. Oxford University Press Oxford U.K. 183--229.]]

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A valuable experience in logic programming;Intelligenza Artificiale;2011

2. Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation;Functional and Constraint Logic Programming;2010

3. Input-Termination of Logic Programs;Logic Based Program Synthesis and Transformation;2005

4. Termination of Logic Programs Using Various Dynamic Selection Rules;Logic Programming;2004

5. Characterisations of Termination in Logic Programming;Program Development in Computational Logic;2004