Termination Proofs for Logic Programs with Tabling

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

48 pages, 6 figures, submitted to ACM Transactions on Computational Logic (TOCL)

Scientific paper

Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often extremely efficient execution mechanism for logic programs. In particular, tabled execution of logic programs terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with Tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the tabling is well-chosen. Starting from these conditions, we give modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-653654

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.