A Dynamic Approach to Characterizing Termination of General Logic Programs
Lists
Only you see this
Abstract
We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach which employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.
BibTeX
@article{shen2003dynamic,
author = {Yi-Dong Shen and Jia-Huai You and Li-Yan Yuan and Samuel S. P. Shen and Qiang Yang},
title = {{A Dynamic Approach to Characterizing Termination of General Logic Programs}},
journal = {ACM Transactions on Computational Logic},
year = {2003},
doi = {10.1145/937555.937556},
}Loading related content...