On the inference of natural level mappings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3049, Issue , 2004, Pages 432-452

  Martin, Jonathan C ^a   King, Andy ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26444596794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25951-0_13     Document Type: Article

References (28)

1. K. R. Apt and M. Bezem. Acyclic Programs. New Generation Computing, 9 (3/4):335-364, 1991.
2. K. R. Apt and D. Pedreschi. Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106 (1):109-157, 1993.
3. K. R. Apt and D. Pedreschi. Modular Termination Proofs for Logic and Pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183-229. Oxford University Press, 1994. Also available as technical report CS-R9316 from Centrum voor Wiskunde en Informatica, CWI, Amesterdam.
4. M. Bezem. Characterizing Termination of Logic Programs with Level Mappings. In E. L. Lusk and R. A. Overbeek, editors, North American Conference on Logic Programming, pages 69-80. MIT Press, 1989.
5. M. Bezem. Strong Termination of Logic Programs. The Journal of Logic Programming, 15(12):79-97, 1993.
6. A. Bossi, N. Cocco, S. Etalle, and S. Rossi. On Modular Termination Proofs of General Logic Programs. Theory and Practice of Logic Programming, 2(3):263-291, 2002.
7. F. Bronsard, T. K. Lakshman, and U. S. Reddy. A Framework of Directionality for Proving Termination of Logic Programs. In K. R. Apt, editor, Joint International Conference and Symposium on Logic Programming, pages 321-335. MIT Press, 1992.
8. M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. The Journal of Logic Programming, 10 (l/2/3&4):91-124, 1991.
9. M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof. Reuse of Results in Termination Analysis of Typed Logic Programs. In M. V. Hermenegildo and G. Puebla, editors, Static Analysis Symposium, number 2477 in Lecture Notes in Computer Science, pages 477-492. Springer-Verlag, 2002.
10. M. Bruynooghe, M. Leuchel, and K. F. Sagonas. A Polyvariant Binding-time Analysis for Off-line Partial Deduction. In C. Hankin, editor, European Symposium on Programming, volume 1381 of Lecture Notes in Computer Science, pages 27-41. Springer-Verlag, 1998.
11. L. Cavedon. Continuity, consistency, and completeness properties of logic programs. In G. Levi and M. Martelli, editors, International Conference on Logic Programming, pages 571-584. MIT Press, 1989.
12. D. De Schreye, K. Verschaetse, and M. Bruynooghe. A Framework for Analysing the Termination of Definite Logic Programs with Respect to Call Patterns. In International Conference on Fifth Generation Computer Systems, pages 481-488. IOS Press, 1992.
13. S. Decorte and D. De Schreye. Demand-driven and constraint-based automatic left-termination analysis of logic programs. In L. Naish, editor, International Conference on Logic Programming, pages 78-92. MIT Press, 1997.
14. S. Decorte and D. De Schreye. Termination analysis: Some practical properties of the Norm and Level Mapping Space. In J. Jaffar, editor, Joint International Conference and Symposium on Logic Programming, pages 235-249. MIT Press, 1998.
15. S. Decorte, D. De Schreye, and M. Fabris. Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis. In D. Miller, editor, International Logic Programming Symposium, pages 420-436. MIT Press, 1993.
16. S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint-based Termination Analysis of Logic Programs. ACM Transactions on Programming Languages and Systems, 21(6):1137-1195, 1999.
17. P. Dembiriski and J. Maluszynski. And-Parallelism with Intelligent Backtracking for Annotated Logic Programs. In Symposium on Logic Programming, pages 29-38. IEEE Press, 1985.
18. S. Etalle, A. Bossi, and N. Cocco. Termination of Well-Moded Programs. The Journal of Logic Programming, 38 (2):243-257, 1999.
19. S. Genaim, M. Codish, J. P. Gallagher, and V. Lagoon. Combining Norms to Prove Termination. In A. Cortesi, editor, Verification, Model Checking and Abstract Interpretation, number 2294 in Lecture Notes in Computer Science, pages 126138. Springer-Verlag, 2002.
20. V. Lagoon, F. Mesnard, and P. Stuckey. Termination Analysis with Types is More Accurate. In C. Palamidessi, editor, International Conference on Logic Programming, Lecture Notes in Computer Science. Springer-Verlag, 2003.
21. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
22. J. C. Martin. Judgement Day: Terminating Logic Programs. PhD thesis, Department of Electronics and Computer Science; University of Southampton, 2000.
23. J. C. Martin, A. King, and P. Soper. Typed Norms for Typed Logic Programs. In J. Gallagher, editor, Logic Program Synthesis and Transformation (Selected Papers), volume 1207 of Lecture Notes in Computer Science, pages 224-238. Springer-Verlag, 1997.
24. J. C. Martin and M. Leuschel. Sonic Partial Deduction. In D. Bjørner, M. Broy, and A. V. Zamulin, editors, Third International Andrei Ershov Memorial Conference, volume 1755 of Lecture Notes in Computer Science, pages 101-112, 1999.
25. D. Pedreschi and S. Ruggieri. Verification of Logic Programs. The Journal of Logic Programming, 39 (1-3):125-176, 1999.
26. J. Van Leeuwen, editor. Handbook of Theoretical Computer Science: Volume B. Elsevier, 1990.
27. W. Vanhoof and M. Bruynooghe. When Size Does Matter. In A. Pettorossi, editor, Logic Based Program Synthesis and Transformation (Selected Papers), volume 2372 of Lecture Notes in Computer Science, pages 129-147, 2001.
28. S. Verbaeten, D. De Schreye, and K. F. Sagonas. Termination Proofs for Logic Programs with Tabling. ACM Transactions on Computational Logic, 2(l):57-92, 2001.