S. Verbaeten, K. Sagonas, and D. De Schreye. Termination proofs for logic programs with tabling. ACM Transactions on Computational Logic, 2(1):57--92, 2001.  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
No context found.
S. Verbaeten, K. Sagonas, and D. De Schreye. Termination proofs for logic programs with tabling. ACM Transactions on Computational Logic, 2(1):57--92, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC