Termination Proofs for Logic Programs with Tabling

ACM Transactions on Computational Logic

Volumn 2, Issue 1, 2001, Pages 57-92

  Verbaeten, Sofie ^a   Schreye, Danny De ^a   Sagonas, Konstantinos ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UPPSALA UNIVERSITY   (Sweden)

Author keywords

Languages; Prolog; SLG Resolution; Tabling; Theory

Indexed keywords

EID: 0345826233     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/371282.371357     Document Type: Article

References (15)

1. Afek, Y., Mansour, Y., and Ostfeld, Z. 1999. Convergence Complexity of Optimistic Rate Based Flow Control Algorithms. J. Algorithm. 30, 1, 106-143.
2. Afek, Y, Mansour, Y, and Ostfeld, Z. 2000. Phantom: A Simple and Effective Flow Control Scheme. Comput. Netw. 32, 3, 277-305.
3. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., and Waarts, O. 1997. Online Load Balancing With Applications To Machine Scheduling and Virtual Circuit Routing. J. Assoc. Comput. Mach. 44, 3, 486-504.
4. Awerbuch, B., Azar, Y, and Plotkin, S. 1993. Throughput Competitive Online Routing. In Proceedings of the 34Th Ieee Symposium on Foundations of Computer Science. 32-40.
5. Awerbuch, B., and Shavitt, Y. 1998. Converging To Approximated Max-Min Flow Fairness in Logarithmic Time. In Proceedings of the 17Th Ieee Infocom Conference. 1350-1357.
6. Azar, Y., Naor, J., and Rom, R. 1992. The Competitiveness of Online Assignement. In Proceedings of the 3Rd Acm-Siam Symposium on Discrete Algorithms. 203-210.
7. Goel, A., Meyerson, A., and Plotkin, S. 2001. Combining Fairness With Throughput: Online Routing With Multiple Objectives. J. Comput. Syst. Sci. 63, 1, 62-79.
8. Graham, R. 1966. Bounds For Certain Multiprocessing Anomalies. Bell Syst. Tech. J. 45, 1563-1581.
9. Hardy, G., Littlewood, J., and Polya, G. 1929. Some Simple Inequalities Satisfied By Convex Functions. Messenger Math. 58, 145-152.
10. Hardy, G., Littlewood, J., and Polya, G. 1934. Inequalities, 1St Ed. Cambridge University Press, London, U.K., and New York, Ny.
11. Hardy, G., Littlewood, J., and Polya, G. 1952. Inequalities, 2Nd Ed. Cambridge University Press, London, U.K., and New York, Ny.
12. Kleinberg, J., Rabani, Y., and Tardos, E. 2001. Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63, 1, 2-20.
13. Kumar, A., and Kleinberg, J. 2000. Fairness Measures For Resource Allocation. In Proceedings of the 41St Ieee Symposium on Foundations of Computer Science.
14. Lorenz, M. 1905. Methods of Measuring Concentrations of Wealth. J. Amer. Statist. Assoc. 9, 209-219.
15. Marshall, A., and Olkin, I. 1979. Inequalities: Theory of Majorization and Its Applications. Volume 143 of Mathematics in Science and Engineering Series. Academic Press, New York, Ny.