Properties of input-consuming derivations

Electronic Notes in Theoretical Computer Science

Volumn 30, Issue 1, 1999, Pages 102-124

  Bossi, A ^a   Etalle, S ^b   Rossi, S ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMS; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SCHEDULING;

BACKTRACKING; LOGIC PROGRAMS; NATURAL NUMBERS; SUSPENSION MECHANISM;

COMPUTER PROGRAM LISTINGS;

EID: 0346457251     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00116-1     Document Type: Conference Paper

References (25)

1. Apt K.R. Introduction to Logic Programming. van Leeuwen J. Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. 1990;495-574 Elsevier, Amsterdam and The MIT Press, Cambridge
2. Apt K.R. From Logic Programming to Prolog. 1997;Prentice Hall
3. Apt K.R., Bezem M. Acyclic programs. New Generation Computing. 9:(3&4):1991;335-363
4. K. R. Apt and I. Luitjes. Verification of logic programs with delay declarations. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the fourth International Conference on Algebraic Methodology and Software Technology, (AMAST'95), Lecture Notes in Computer Science, Berlin, 1995. Springer-Verlag.
5. Apt K.R., Pedreschi D. Reasoning about termination of pure Prolog programs. Information and Computation. 106:(1):1993;109-157
6. Apt K.R., Pedreschi D. Modular termination proofs for logic and pure Prolog programs. Levi G. Advances in Logic Programming Theory. 1994;183-229 Oxford University Press
7. Apt K.R., Pellegrini A. On the occur-check free Prolog programs. ACM Toplas. 16:(3):1994;687-726
8. Apt K.R., Marchiori E. Reasoning about Prolog programs: from Modes through Types to Assertions. Formal Aspects of Computing. 6:(6A):1994;743-765
9. Bezem M. Strong termination of logic programs. Journal of Logic Programming. 15:(1&2):1993;79-97
10. A. Bossi, S. Etalle, and S. Rossi. Properties of input-consuming derivations. Technical Report CS 99-06, Universiteit Maascricht.
11. L. Cavedon. Continuity, consistency and completeness properties for logic programs. In G. Levi and M. Martelli, editors, 6 International conference on Logic Programming, pages 571-584. MIT press, 1989.
12. Cavedon L. Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science. 86:1991;81-92
13. De Schreye D., Decorte S. Termination of logic programs: the never-ending story. Journal of Logic Programming. 19-20:1994;199-260
14. S. Decorte, D. De Schreye, and M. Fabris. Automatic inference of norms: a missing link in automatic termination analysis. In D. Miller, editor, Proc. Tenth International Logic Programming Symposium, number 526 in Lecture Notes in Computer Science, pages 420-436. Springer-Verlag, 1993.
15. Etalle S., Bossi A., Cocco N. Termination of well-moded programs. Journal of Logic Programming. 38:(2):1999;243-257
16. S. Etalle, M. Gabbrielli, and E. Marchiori. A Transformation System for CLP with Dynamic Scheduling and CCP. In C. Consel, editor, ACM-SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation. ACM Press, 1997.
17. Hill P.M., Lloyd J.W. The Gödel programming language. 1994;The MIT Press
18. Intelligent Systems Laboratory, Swedish Institute of Computer Science, PO Box 1263, S-164 29 Kista, Sweden. SICStus Prolog User's Manual, 1997. http://www.sics.se/isl/sicstus/sicstus_toc.html.
19. J. W. Lloyd. Foundations of Logic Programming. Symbolic Computation Artificial Intelligence. Springer-Verlag, Berlin, 1987. Second edition.
20. E. Marchiori and F. Teusink. Proving termination of logic programs with delay declarations. In J. Lloyd, editor, Proc. Twelfth International Logic Programming Symposium. MIT Press, 1995.
21. J. G. Smaus. Proving termination of input-consuming logic programs. In D. DeSchreye, editor, 16th International Conference on Logic Programming. MIT press, 1999.
22. J.-G. Smaus, P. M. Hill, and A. M. King. Termination of logic programs with block declarations running in several modes. In C. Palamidessi, editor, Proceedings of the 10th Symposium on Programming Language Implementations and Logic Programming, LNCS. Springer-Verlag, 1998.
23. Z. Somogyi, F. Henderson, and T. Conway. Mercury: an efficient purely declarative logic programming language. In Australian Computer Science Conference, 1995. available at http://www.cs.mu.oz.au/mercury/papers.html.
24. Ueda K. Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. Nivat M., Fuchi K. Programming of Future Generation Computers. 1988;441-456 North Holland, Amsterdam
25. Mark Wallace and André Veron. Tow problems - two solutions: One system - ECLiPSe. In Proceedings IEE Colloquium on Advanced Software Technologies for Scheduling, April 1993.