BriefGPT.xyz
Mar, 2008
通过术语重写自动终止逻辑程序的证明
Automated Termination Proofs for Logic Programs by Term Rewriting
HTML
PDF
P. Schneider-Kamp, J. Giesl, A. Serebrenik, R. Thiemann
TL;DR
本文介绍了通过改良变换法来解决逻辑程序终止性分析的限制的方法,并将其应用于 AProVE 终止证明器进行实验与评估。
Abstract
There are two kinds of approaches for
termination analysis
of
logic programs
: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program.
→