Termination of simply moded logic programs with dynamic scheduling

ACM Transactions on Computational Logic

Volumn 5, Issue 3, 2004, Pages 470-507

  Bossi, Annalisa ^a   Etalle, Sandro ^b,d   Rossi, Sabina ^a   Smaus, Jan Georg ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c UNIVERSITY OF FREIBURG   (Germany)

^d CWI   (Netherlands)

Author keywords

Dynamic scheduling; Logic programs; Simply moded; Termination

Indexed keywords

DYNAMIC SCHEDULING; LOGIC PROGRAMS; SIMPLY MODED; TERMINATION;

ALGORITHMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; SCHEDULING; SEMANTICS;

LOGIC PROGRAMMING;

EID: 3142782051     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1013560.1013564     Document Type: Article

References (34)

1. APT, K. R. 1990. Logic Programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B: Formal Models and Semantics. Elsevier and The MIT Press, Amsterdam, The Netherlands, and Cambridge, MA, 495-574.
2. APT, K. R. 1997. From Logic Programming to Prolog. Prentice Hall, London, U.K.
3. APT, K. R. AND ETALLE, S. 1993. On the unification free Prolog programs. In Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS'93), A. Borzyszkowski and S. Sokolowski, Eds. Lecture Notes in Computer Science, vol. 711. Springer-Verlag, Berlin, Germany, 1-19.
4. APT, K. R. AND LUITJES, I. 1996. Verification of logic programs with delay declarations. In Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology (AMAST95), V. Alagar and M. Nivat, Eds. Lecture Notes in Computer Science, vol. 936. Springer-Verlag, Berlin, Germany, 66-90.
5. APT, K. R. AND PEDRESCHI, D. 1994. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory, G. Levi, Ed. Oxford University Press, Oxford, U.K., 183-229.
6. BOSSI, A., ETALLE, S., AND ROSSI, S. 2000. Semantics of well-moded input-consuming logic programs. Comput. Lang. 26, 1, 1-25.
7. BOSSI, A., ETALLE, S., AND ROSSI, S. 2002. Properties of input-consuming derivations. Theor. Pract. Logic Programm. 2, 2, 125-154.
8. BOSSI, A., ETALLE, S., ROSSI, S., AND SMAUS, J.-G. 2001. Semantics and termination of simply moded logic programs with dynamic scheduling. In Proceedings of the European Symposium on Programming (Genoa, Italy), D. Sands, Ed. Lecture Notes in Computer Science, vol. 2028. Springer-Verlag, Berlin, Germany, 402-416.
9. BOSSI, A., GABRIELLI, M., LEVI, G., AND MARTELLI, M. 1994. The S-semantics approach: Theory and applications. J. Logic Programm. 19 & 20, 149-198.
10. BOYE, J. 1996. Directional types in logic programming, Ph.D. dissertation, Linköpings Universitet, Linköping, Sweden
11. DE BOER, F. AND PALAMIDESSI, C. 1991. A fully abstract model for concurrent constraint programming. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT/ CAAP), S. Abramsky and T. Maibaum, Eds. Lecture Notes in Computer Science, vol. 493. Springer-Verlag, Berlin, Germany, 296-319.
12. ETALLE, S., BOSSI, A., AND Cocco, N. 1999. Termination of well-moded programs. J. Logic Programm. 38, 2, 243-257.
13. ETALLE, S., GABBRIELLI, M., AND MEO, M. C. 2002. Transformations of ccp programs. ACM Trans. Programm. Lang. Syst. 23, 3, 304-395.
14. FALASCHI, M., GABBRIELLI, M., MARRIOTT, K., AND PALAMIDESSI, C. 1997. Constraint logic programming with dynamic scheduling: a semantics based on closure operators. Inform. Computat. 137, 1, 41-67.
15. KOWALSKI, R. A. 1979. Algorithm = logic + control. Commun. ACM 22, 7, 424-436.
16. LLOYD, J. W. 1987. Foundations of Logic Programming, 2nd ed. Symbolic Computation - Artificial Intelligence Series. Springer-Verlag, Berlin, Berlin, Germany.
17. LÜTTRINGHAUS-KAPPEL, S. 1993. Control generation for logic programs. In Proceedings of the 10th International Conference on Logic Programming (Budapest, Hungary), D. Warren, Ed. The MIT Press, Cambridge, MA. 478-495.
18. MARCHIORI, E. AND TEUSINK, P. 1999. Termination of logic programs with delay declarations. J. Logic Programm. 39, 1-3, 95-124.
19. MARTIN, J. C. AND KING, A. M. 1997. Generating efficient, terminating logic programs. In Proceedings of the 7th International Joint Conference on Theory and Practice of Software Development (Lille, France), M. Bidoit and M. Dauchet, Eds. Lecture Notes in Computer Science, vol. 1214. Springer-Verlag, Berlin, Germany, 273-184.
20. NAISH, L. 1982 (Revised July 1983). An introduction to MU-Prolog. Tech. rep. 82/2, Department of Computer Science, University of Melbourne, Melbourne, Australia.
21. NAISH, L. 1986. Negation and Control in Prolog. Lecture Notes in Computer Science, vol. 238. Springer-Verlag, New York.
22. NAISH, L. 1988. Parallelizing NU-Prolog. In Proceedings of the 5th International Conference/Symposium on Logic Programming (Seattle, Washington), K. A. Bowen and R. A. Kowalski, Eds. The MIT Press, Cambridge, MA, 1546-1564.
23. NAISH, L. 1993. Coroutining and the construction of terminating logic programs. Australian Comput. Sci. Commun. 15, 1, 181-190.
24. PEDRESCHI, D., RUGGIERI, S., AND SMAUS, J.-G. 2002. Classes of terminating logic programs. Theor. Pract. Logic Programm. 3, 2, 369-418.
25. RUGGIERI, S. 1997. Termination of constraint logic programs. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy. Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, Berlin, Germany, 838-848.
26. SARASWAT, V. A. AND RINARD, M. 1990. Concurrent constraint programming. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages (San Francisco, California). ACM, New York, NY, 232-245.
27. SMAUS, J.-G. 1999a. Modes and types in logic programming. Ph.D. dissertation, University of Kent at Canterbury, Canterbury, U.K. Available online from http://www.cs.ukc.ac.uk/pubs/1999/986/.
28. SMAUS, J.-G. 1999b. Proving termination of input-consuming logic programs. In Proceedings of the 16th International Conference on Logic Programming (Las Cruces, NM), D. De Schreye, Ed. The MIT Press, Cambridge, MA, 335-349.
29. SMAUS, J.-G., HILL, P. M., AND KING, A. M. 1998. Termination of logic programs with block declarations running in several modes. In Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming (Pisa, Italy), C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 1490. Springer-Verlag, Berlin, Germany, 73-88.
30. SMAUS, J.-G., HILL, P. M., AND KING, A. M. 2001. Verifying termination and error-freedom of logic programs with block declarations. Theor. Pract. Logic Programm, 1, 4, 447-486.
31. STERLING, L. AND SHAPIRO, E. 1986. The Art of Prolog. The MIT Press, Cambridge, MA.
32. UEDA, K. AND FURUKAWA, K. 1988. Transformation rules for GHC Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems. Institute for New Generation Computer Technology, Tokyo, OHMSHA Ltd, Tokyo, and Springer-Verlag, Tokyo, Japan, 582-591.
33. UEDA, K. AND MORITA, M. 1994. Moded flat GHC and its message-oriented implementation technique. New Gen. Comput. 13, 1, 3-43.
34. VAN EMDEN, M. H. AND DE LUCENA, G. J. 1982. Predicate logic as a language for parallel programming. In Logic Programming, K. Clark and S.-A. Tärnlund, Eds. Academic Press, London, U.K.