Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Theory and Practice of Logic Programming 1 Automated Termination Analysis for Logic
 

Summary: Under consideration for publication in Theory and Practice of Logic Programming 1
Automated Termination Analysis for Logic
Programs with Cut
PETER SCHNEIDER-KAMP
Dept. of Mathematics and Computer Science, University of Southern Denmark, Denmark
JšURGEN GIESL, THOMAS STRšODER
LuFG Informatik 2, RWTH Aachen University, Germany
ALEXANDER SEREBRENIK
Dept. of Mathematics and Computer Science, TU Eindhoven, The Netherlands
RENŽE THIEMANN
Institute of Computer Science, University of Innsbruck, Austria
submitted 1 January 2003; revised 1 January 2003; accepted 1 January 2003
Abstract
Termination is an important and well-studied property for logic programs. However, al-
most 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 pro-
grams without cuts, where termination of the cut-free program implies termination of
the original program. Hence after this pre-processing, any technique for proving termina-
tion of definite logic programs can be applied. We implemented this pre-processing in our

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences