On Modular Termination Proofs of General Logic Programs

Details On Modular Termination Proofs of General Logic Programs On Modular Termination Proofs of General Logic Programs

2000-05-11

arxiv.org/abs/cs/0005018v2

Computer Science

Logic in Computer Science

29 pages. To appear in Theory and Practice of Logic Programming

Scientific paper

We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider programs consisting of a hierarchy of modules and supply a general result for proving termination by dealing with each module separately. For programs which are in a certain sense well-behaved, namely well-moded or well-typed programs, we derive both a simple verification technique and an iterative proof method. Some examples show how our system allows for greatly simplified proofs.

Affiliated with

Also associated with

No associations

Rating

On Modular Termination Proofs of General Logic Programs 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 On Modular Termination Proofs of General Logic Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Modular Termination Proofs of General Logic Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392677