Generating Efficient, Terminating Logic Programs

Part of book or chapter of book English OPEN
Martin, Jonthan C.; King, Andy;
(1997)
  • Publisher: Springer Verlag
  • Subject: QA76
    arxiv: Computer Science::Programming Languages

The objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial so... View more
  • References (33)
    33 references, page 1 of 4

    4. F. Benoy and A. King. Inferring argument size relations with CLP(R). In LOP-

    14. L. Naish. Coroutining and the construction of terminating logic programs. In

    Szeredi, editors, Proceedings of the Seventh International Conference on Logic Pro-

    2. K.R. Apt and D. Pedreschi. Proving termination of general Prolog programs.

    declarations. In ILPS'95, pages 447{461. MIT Press, 1995.

    Stus Prolog User's Manual, 1995.

    1996. TR-96-31, University of Pisa, Italy.

    Conference Workshop W2 on Verication and Analysis of Logic Programs , Bonn,

    1987.

    Springer-Verlag, 1995.

  • Metrics
Share - Bookmark