Termination proofs for logic programs with tabling

DOI10.1145/371282.371357zbMath1365.68153arXivcs/0003045OpenAlexW2129825950WikidataQ58968417 ScholiaQ58968417MaRDI QIDQ5738911

Danny De Schreye, Sofie Verbaeten, Konstantinos Sagonas

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/0003045

zbMATH Keywords

tablingPrologSLG-resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Using linear constraints for logic program termination analysis ⋮ Fast offline partial evaluation of logic programs ⋮ A practical analysis of non-termination in large logic programs ⋮ Termination prediction for general logic programs

This page was built for publication: Termination proofs for logic programs with tabling