Semantics and termination of simply-moded logic programs with dynamic scheduling

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

Volumn 2028, Issue , 2001, Pages 402-416

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

^a Università di   (Italy)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER SOFTWARE SELECTION AND EVALUATION; LOGIC PROGRAMMING; PARALLEL PROGRAMMING; SCHEDULING; SEMANTICS;

CONTROL DYNAMIC; DYNAMIC SCHEDULING; LOGIC PROGRAMS; MODEL-THEORETIC SEMANTICS; RUNTIMES; SELECTION RULES; SUFFICIENT CRITERION; TECHNICAL DETAILS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84945259149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45309-1_27     Document Type: Conference Paper

References (20)

1. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495-574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
2. K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
3. K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of MFCS’93, LNCS, pages 1-19. Springer-Verlag, 1993.
4. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In V. S. Alagar and M. Nivat, editors, Proceedings of AMAST’95, LNCS, pages 66-90. Springer-Verlag, 1995. Invited Lecture.
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. ENTCS, 30(1), 1999. http://www.elsevier.nl/locate/entcs.
7. A. Bossi, S. Etalle, and S. Rossi. Semantics of input-consuming programs. In J. Lloyd, editor, CL 2000. Springer-Verlag, 2000.
8. A. Bossi, S. Etalle, S. Rossi, and J.-G. Smaus. Semantics and termination of simply-moded logic programs with dynamic scheduling. Available via CoRR: http://arXiv.org/archive/cs/intro.html, 2001.
9. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 19 20:149-197, 1994.
10. S. Etalle, A. Bossi, and N. Cocco. Termination of well-moded programs. Journal of Logic Programming, 38(2):243-257, 1999.
11. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation, 137:41-67, 1997.
12. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. The MIT Press, 1994.
13. Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User’s Manual, 1998. http://www.sics.Se/sicstus/docs/3.7.1/html/sicstustoc.html.
14. R. A. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7):424-436, 1979.
15. J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation - Artificial Intelligence. Springer-Verlag, 1987.
16. L. Naish. Negation and Control in Prolog, volume 238 of LNCS. Springer-Verlag, 1986.
17. L. Naish. Parallelizing NU-Prolog. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of ICLP/SLP’88, pages 1546-1564. MIT Press, 1988.
18. J.-G. Smaus. Proving termination of input-consuming logic programs. In D. De Schreye, editor, Proceedings of ICLP’99, pages 335-349. MIT Press, 1999.
19. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
20. K. Ueda and M. Morita. Moded Flat GHC and its message-oriented implementation technique. New Generation Computing, 13(1):3-43, 1994.