Generating efficient, terminating logic programs

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

Volumn 1214, Issue , 1997, Pages 273-284

  Martin, Jonathan C ^a   King, Andy ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LOGIC PROGRAMMING; SOFTWARE DESIGN;

AUTOMATIC TRANSFORMATIONS; COMPUTATION RULES; DYNAMIC SELECTION; LOGIC PROGRAMS; PROGRAM CORRECTNESS;

COMPUTER CIRCUITS;

EID: 84956993004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030603     Document Type: Conference Paper

References (14)

1. K.R. Apt and M. Bezem. Acyclic programs. In ICLP, pages 617-633. M1T Press, 1990.
2. K.R. Apt and D. Pedreschi. Proving termination of general Prolog programs. In TACS'91, volume 526 of LNCS, pages 265-289. Springer-Verlag, 1991.
3. K.R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In Fourth International School for Computer Science Researchers. OUP, 1994.
4. E Benoy and A. King. Inferring argument size relations with CLP(R). In LOPSTR'96. Springer-Verlag, 1996.
5. M. Bezem. Characterizing termination of logic programs with level mappings. In NACLP' 89, pages 69-80, Cleveland, Ohio, USA, 1989. MIT Press.
6. P.M. Hill and J.W. Lloyd. The Giödel Programming Language. MIT Press, 1994.
7. Intelligent Systems Laboratory, SICS, PO Box 1263, S-164 28 Kista, Sweden. SICStus Prolog User's Manual, 1995.
8. R. Kowalski. Algorithm = Logic + Control. CACM, 22(7):424-436, July 1979.
9. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
10. S. L0ttringhaus-Kappel. Control Generation for Logic Programs. In ICLP'93, pages 478-495. MIT Press, 1993.
11. E. Marchiori and E Teusink. Proving termination of logic programs with delay declarations. In ILPS'95, pages 447-461. MIT Press, 1995.
12. E. Marchiori and E Teusink. Proving deadlock freedom of logic programs with dynamic scheduling. In JICSLP'96 Post-Conference Workshop W2 on Verification and Analysis of Logic Programs, Bonn, 1996. TR-96-31, University of Pisa, Italy.
13. F. Mesnard. Towards Automatic Control for CLP(X) Programs. In LOPSTR'95. Springer-Verlag, 1995.
14. L. Naish. Coroutining and the construction of terminating logic programs. In Australian Computer Science Conference, Brisbane, February 1993.