A dynamic approach to characterizing termination of general logic programs

DOI10.1145/937555.937556zbMATH Open1365.68152OpenAlexW1976132254MaRDI QIDQ5267437FDOQ5267437

Authors Yi-Dong Shen, Jia-Huai You, Li Yan Yuan, Samuel Shan-Pu Shen, Qiang Yang 

Publication date 13 June 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0204031

zbMATH Keywords

Prologtermination analysisdynamic characterization

Mathematics Subject Classification ID

Logic programming (68N17)

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.

• Program Development in Computational Logic
• scientific article; zbMATH DE number 1149425
• Reasoning in Dynamic Logic about Program Termination
• Logic Programming
• A general framework for automatic termination analysis od logic programs
• A methodology for proving termination of logic programs
• Termination prediction for general logic programs
• scientific article; zbMATH DE number 1696776

(9)

• Title not available (Why is no real title available?)
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• Reasoning in Dynamic Logic about Program Termination
• A Terminating Evaluation-Driven Variant of G3i
• Termination of simply moded logic programs with dynamic scheduling
• Non-termination analysis of logic programs with integer arithmetics
• Productive corecursion in logic programming
• A novel derivation framework for definite logic program
• Termination prediction for general logic programs

This page was built for publication: A dynamic approach to characterizing termination of general logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267437)