A dynamic approach to characterizing termination of general logic programs

DOI10.1145/937555.937556zbMath1365.68152arXivcs/0204031OpenAlexW1976132254MaRDI QIDQ5267437

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

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)

Related Items (5)

Productive corecursion in logic programming ⋮ A Novel Derivation Framework For Definite Logic Program ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Non-termination analysis of logic programs with integer arithmetics ⋮ Termination prediction for general logic programs

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