Automated termination analysis for logic programs with cut

Automated termination analysis for logic programs with cut (2010)

by Peter Schneider-kamp , Jürgen Giesl , Thomas Ströder , Alexander Serebrenik , René Thiemann

Citations:

22 - 12 self

User correction supplied by mph

Datum	Value	Source
TITLE	Automated termination analysis for logic programs with cut	user correction
AUTHOR NAME	Peter Schneider-kamp	user correction
AUTHOR NAME	Jürgen Giesl	user correction
AUTHOR NAME	Thomas Ströder	user correction
AUTHOR NAME	Alexander Serebrenik	user correction
AUTHOR AFFIL	Dept. of Mathematics and Computer Science, TU Eindhoven; RENÉ THIEMANN; Institute of Computer Science, University of Innsbruck	user correction
AUTHOR ADDR	The Netherlands; Austria	user correction
AUTHOR NAME	René Thiemann	user correction
ABSTRACT	Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-free program implies termination of the original program. Hence after this pre-processing, any technique for proving termination of definite logic programs can be applied. We implemented this pre-processing in our	SVM HeaderParse 0.2
YEAR	2010	user correction
PAGES	177--193	INFERENCE
CITATIONS	0 found	ParsCit 1.0