论文信息 - Methodology for Proving the Termination of Logic Programs

Methodology for Proving the Termination of Logic Programs

In this paper, we describe a methodology for proving termination of logic programs. First, we introduce U-graphs as an abstraction of logic programs and establish that SLDNF-derivations can be realized by instances of paths in the U-graphs. Such a relation enables us to use U-graphs for establishing the universal termination of logic programs. In our method, we associate pre- and post-assertions to the nodes of the graph and ordered assertions to selected edges of the graph. With this as the basis, we develop a simple method for establishing the termination of logic programs. The simplicity/practicality of the method is illustrated through examples.

R. K. Shyamasundar | Bal Wang | R. Shyamasundar | Bal Wang

[1] Wlodzimierz Drabent,et al. Inductive Assertion Method for Logic Programs , 1988, Theor. Comput. Sci..

[2] Kenneth Kunen,et al. Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[3] John Potter,et al. Characterisation of Terminating Logic Programs , 1986, SLP.

[4] Doug DeGroot,et al. Logic programming - functions, relations and equations , 1986 .

[5] Roberto Barbuti,et al. A Tool to Check the Non-Floundering Logic Programs and Goals , 1988, PLILP.

[6] Hirohisa Seki,et al. Verification of Prolog Programs Using an Extension of Execution , 1986, ICLP.

[7] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.

[8] John C. Shepherdson,et al. Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[9] Uday S. Reddy,et al. On the Relationship Between Logic and Functional Languages , 1986, Logic Programming: Functions, Relations, and Equations.

[10] Jürgen Avenhaus,et al. On Logic Programs with Data-Driven Computations , 1985, European Conference on Computer Algebra.

[11] Nachum Dershowitz,et al. Termination of Rewriting , 1987, J. Symb. Comput..

[12] Amir Pnueli,et al. Proving Termination of Prolog Programs , 1985, Logic of Programs.

[13] John W. Lloyd,et al. A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..