Termination of well-typed logic programs

We consider an extended definition of well-typed programs to general logic programs, i.e. logic programs with negated literals in the body of the clauses. This is a quite large class of programs which properly includes all the well-moded ones. We study termination properties of well-typed general programs while employing the Prolog's left-to-right selection rule. We introduce the notion of typed acceptable program and provide an algebraic characterization for the class of well-typed programs whic hterminate on all well-typed queries.

[1]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

[2]  Krzysztof R. Apt,et al.  Introduction to Logic Programming , 1988 .

[3]  Krzysztof R. Apt,et al.  From logic programming to Prolog , 1996, Prentice Hall International series in computer science.

[4]  Danny De Schreye,et al.  Automatic Inference of Norms: A Missing Link in Automatic Termination Analysis , 1993, ILPS.

[5]  Dino Pedreschi,et al.  Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..

[6]  Sandro Etalle,et al.  On the Unification Free Prolog Programs , 1993, MFCS.

[7]  Fergus Henderson,et al.  The Implementation of Mercury, an Efficient Purely Declarative Logic Programming Language , 1994, ILPS Workshop: Implementation Techniques for Logic Programming Languages.

[8]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[9]  Danny De Schreye,et al.  Deriving Termination Proofs for Logic Programs, Using Abstract Procedures , 1991, International Conference on Logic Programming.

[10]  Krzysztof R. Apt,et al.  Verification of Logic Programs with Delay Declarations , 1995, AMAST.

[11]  Maurice Bruynooghe,et al.  A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns , 1992, FGCS.

[12]  Marc Bezem,et al.  Strong Termination of Logic Programs , 1991, J. Log. Program..

[13]  Danny De Schreye,et al.  Constraint-based termination analysis of logic programs , 1999, TOPL.

[14]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Sandro Etalle,et al.  Properties of Input-Consuming Derivations , 2001, Theory and Practice of Logic Programming.

[16]  Danny De Schreye,et al.  Termination of Logic Programs: The Never-Ending Story , 1994, J. Log. Program..

[17]  Uday S. Reddy,et al.  A Framework of Directionality for Proving Termination of Logic Programs , 1992, JICSLP.

[18]  Danny De Schreye,et al.  Termination Analysis of Tabled Logic Programs Using Mode and Type Information , 1999, Fuji International Symposium on Functional and Logic Programming.

[19]  Dino Pedreschi,et al.  Modular termination proofs for logic and pure PROLOG programs , 1993 .

[20]  Danny De Schreye,et al.  Modular Termination Proofs for Prolog with Tabling , 1999, PPDP.

[21]  KRZYSZTOF R. APT,et al.  A New Definition of SNDNF-Resolution , 1994, J. Log. Program..

[22]  Danny De Schreye.  Proving Termination of Input-Consuming Logic Programs , 1999 .

[23]  Annalisa Bossi,et al.  Norms on Terms and their use in Proving Universal Termination of a Logic Program , 1994, Theor. Comput. Sci..

[24]  Dino Pedreschi,et al.  Verification of Logic Programs , 1999, J. Log. Program..

[25]  Sandro Etalle,et al.  Termination of Well-Moded Programs , 1999, J. Log. Program..

[26]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.