Automated Termination Analysis for Logic Programs with Cut

Details Automated Termination Analysis for Logic Programs with Cut Automated Termination Analysis for Logic Programs with Cut

2010-07-28

arxiv.org/abs/1007.4908v1

Theory and Practice of Logic Programming, 10(4-6), 365-381, 2010

Computer Science

Logic in Computer Science

Scientific paper

10.1017/S1471068410000165

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 termination prover AProVE and evaluated it successfully with extensive experiments.

Affiliated with

Also associated with

No associations

Rating

Automated Termination Analysis for Logic Programs with Cut does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automated Termination Analysis for Logic Programs with Cut, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automated Termination Analysis for Logic Programs with Cut will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-73760