Automatic finite unfolding using well-founded measures

DOI10.1016/0743-1066(95)00149-2zbMath0867.68023OpenAlexW2008251703MaRDI QIDQ3129508

Danny De Schreye, Bern Martens

Publication date: 9 June 1997

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/125403

zbMATH Keywords

logic programscontrol unfolding

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Type-based homeomorphic embedding for online termination ⋮ Loop checks for logic programs with functions ⋮ Termination prediction for general logic programs ⋮ A Study on the Practicality of Poly-Controlled Partial Evaluation

This page was built for publication: Automatic finite unfolding using well-founded measures