Termination of logic programs using various dynamic selection rules

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

Volumn 3132, Issue , 2004, Pages 43-57

  Smaus, Jan Georg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE; SCHEDULING;

DYNAMIC SCHEDULING; DYNAMIC SELECTION; LOGIC PROGRAMS; NONLOCAL; ONE DIMENSION; TERMINATION CRITERIA;

LOGIC PROGRAMMING;

EID: 34548134760     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_4     Document Type: Article

References (23)

1. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
2. K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proc. of the 18th International Symposium on Mathematical Foundations of Computer Science, volume 711 of LNCS, pages 1-19. Springer-Verlag, 1993.
3. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In V. S. Alagar and M. Nivat, editors, Proc. of the 4th International Conference on Algebraic Methodology and Software Technology, volume 936 of LNCS, pages 66-90. Springer-Verlag, 1995.
4. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109-157, 1993.
5. 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.
6. A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Theory and Practice of Logic Programming, 2(2):125-154, 2002.
7. A. Bossi, S. Etalle, S. Rossi, and J.-G. Smaus. Semantics and termination of simply moded logic programs with dynamic scheduling. Transactions on Computational Logic, 2004. To appear in summer 2004.
8. D. De Schreye and S. Decorte. Termination of logic programs: The never-ending story. Journal of Logic Programming, 19/20:199-260, 1994.
9. N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, 2001(1/2):117-156, 2001.
10. S. Etalle, A. Bossi, and N. Cocco. Termination of well-moded programs. Journal of Logic Programming, 38(2):243-257, 1999.
11. S. Genaim, M. Codish, J. Gallagher, and V. Lagoon. Combining norms to prove termination. In A. Cortesi, editor, Proc. of the 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation, volume 2294 of LNCS, pages 126-138. Springer-Verlag, 2002.
12. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
13. S. Lüttringhaus-Kappel. Control generation for logic programs. In D. S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, pages 478-495. MIT Press, 1993.
14. E. Marchiori and F. Teusink. On termination of logic programs with delay declarations. Journal of Logic Programming, 39(1-3):95-124, 1999.
15. J. Martin and A. King. Generating efficient, terminating logic programs. In M. Bidoit and M. Dauchet, editors, Proc. of the 7th International Conference on Theory and Practice of Software Development, volume 1214 of LNCS, pages 273-284. Springer-Verlag, 1997.
16. F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Proc. of the 8th Static Analysis Symposium, volume 2126 of LNCS, pages 93-110. Springer-Verlag, 2001.
17. L. Naish. Coroutining and the construction of terminating logic programs. Technical Report 92/5, Department of Computer Science, University of Melbourne, 1992.
18. D. Pedreschi, S. Ruggieri, and J.-G. Smaus. Classes of terminating logic programs. Theory and Practice of Logic Programming, 2(3):369-418, 2002.
19. J.-G. Smaus. Proving termination of input-consuming logic programs. In D. De Schreye, editor, Proc. of the International Conference on Logic Programming, pages 335-349. MIT Press, 1999.
20. J.-G. Smaus. Termination of logic programs for various dynamic selection rules. Technical Report 191, Institut für Informatik, Universität Freiburg, 2003.
21. J.-G. Smaus. Termination of logic programs using various dynamic selection rules. Technical Report 203, Institut für Informatik, Universität Freiburg, 2004.
22. J.-G. Smaus, P. M. Hill, and A. M. King. Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, 1(4):447-486, 2001.
23. Swedish Institute of Computer Science. SICStus Prolog User's Manual, 2003. http://www.sics.se/isl/sicstuswww/site/documentation.html.