Termination of logic programs with delay declarations

Journal of Logic Programming

Volumn 39, Issue 1, 1999, Pages 95-124

  Marchiori, Elena ^a   Teusink, Frank ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM DIAGNOSTICS; QUERY LANGUAGES;

DELAY DECLARATIONS; DELAY RECURRENT PROGRAMS; PROGRAM TERMINATION;

LOGIC PROGRAMMING;

EID: 0032676384     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10034-1     Document Type: Article

References (27)

1. K.R. Apt, I. Luitjes, Verification of logic programs with delay declarations, in: Invited Lecture, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST'95), Lecture Notes in Computer Science 936, Springer, Berlin, 1995, pp. 66-90.
2. K.R. Apt, D. Pedreschi, Reasoning about termination of pure Prolog programs, Information and Computation 106 (1) (1993) 109-157.
3. M. Bezem, Characterizing termination of logic programs with level mappings, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of the North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 69-80.
4. M. Bezem, Strong termination of logic programs, Journal of Logic Programming 1-2 (15) (1993) 79-97.
5. A. Bossi, N. Cocco, M. Fabris, Norms on terms and their use in proving universal termination of logic programs, Theoretical Computer Science 124 (1994) 297-328.
6. L. Cavedon, Continuity, consistency, and completeness properties for logic programs, in: G. Levi, M. Martelli (Eds.), Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA, 1989, pp. 571-584.
7. P. Chambre, P. Deransart, Towards a proof method of non-suspension of Concurrent Constraint Logic Programs, in: F. de Boer, M. Gabbrielli (Eds.), Proceedings of the W2 Post-Conference Workshop, International Conference on Logic Programming, Free University, Amsterdam. 1994.
8. S. Decorte, D. De Schreye, M. Fabris, Automatic inference of norms: a missing link in automatic termination analysis, in: Proceedings of the International Logic Programming Symposium, MIT Press, Cambridge, MA, 1993, pp. 420-436.
9. N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation 8 (1987) 69-116.
10. S. Etalle, M. Gabbrielli, Layered Modes, in: F. de Boer, M. Gabbrielli (Eds.), Proceedings of the JICSLP Post-conference Workshop on Verification and Analysis of Logic Programs, University of Pisa, 1996.
11. S. Etalle, M. Gabbrielli, E. Marchiori, A transformation system for CLP with dynamic scheduling and CCP, in: Proceedings of the 1997 ACM-SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation, ACM Press, New York, 1997.
12. A. Heaton, P. Hill, A. King, Analysis of Logic Programs with Delay, in: Logic Program Synthesis and Transformation, Springer, Berlin, 1997.
13. P.M. Hill, J.W. Lloyd, The Gödel Programming Language, MIT Press, Cambridge, MA, 1994.
14. S. Lüttringhaus-Kappel, Control generation for logic programs, in: Proceedings of the International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 478-495.
15. E. Marchiori, F. Teusink, Proving termination of logic programs with delay declarations, in: J. Lloyd (Ed.), Proceedings of the 1995 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 447-464.
16. E. Marchiori, F. Teusink, On deadlock freedom of logic programs with dynamic schedulin, in: F. de Boer, M. Gabbrielli (Eds.), Proceedings of the JICSLP post-conference workshop on Verification and Analysis of Logic Programs, University of Pisa, 1996.
17. J.M. Martin, A.M. King, Generating efficient, terminating logic programs, in: TAPSOFT 97: Proceedings, Springer, Berlin, 1997.
18. L. Naish, Automating control of logic programs, Journal of Logic Programming 2 (3) (1985) 167-183.
19. L. Naish, Coroutining and the construction of terminating logic programs, Technical Report 92/5, Department of Computer Science, University of Melbourne, 1992.
20. N.J. Nilsson, Principles of Artificial Intelligence, Springer, Berlin, 1982.
21. R.K.K. Rao, Termination Characteristics of Logic Programs, Ph.D. Thesis, University of Bombay, 1993.
22. U.S. Reddy, On the relationship between logic and functional languages, in: D. DeGroot, G. Lindstrom (Eds.), Functional and Logic Programming, Prentice-Hall, Englewood Cliffs, NJ, 1986, pp. 3-36.
23. D. De Schreye, S. Decorte, Termination of logic programs: The never ending story, Journal of Logic Programming 19 (20) (1994) 199-260.
24. D. De Schreye, K. Verschaetse, M. Bruynooghe, A framework for the analysis and termination of definite logic programs with respect to call patterns, in: Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, Tokio, 1992.
25. J. Thom, J. Zobel, NU-prolog reference manual, Technical Report 86/1, Department of Computer Science, University of Melbourne, 1986.
26. M.H. van Emden, G.J. de Lucena, Predicate logic as a language for parallel programming, in: K.L. Clark, S.-A. Tärnlund (Eds.), Logic Programming, Academic Press, London, 1982.
27. L. Vieille, Recursive query processing: the power of logic, Theoretical Computer Science 69 (1) (1989) 1-53.