Acceptable Programs Revisited

Abstract Acceptable logic programs have been studied extensively in the context of proving termination of Prolog programs. It is difficult, however, to establish acceptability from the definition since this depends on finding a suitable model, which need not be a Herbrand model in general, together with a suitable level mapping that one can use to check the conditions which characterize acceptability. In this paper, we will see that when working over a fixed but arbitrary preinterpretation, a method can be provided for obtaining both a suitable model and a canonical level mapping which are sufficient for this purpose. Furthermore, the canonical model and level mapping obtained will turn out to be sufficient for discussing termination of non-ground queries.

[1]  Pascal Hitzler,et al.  Strictly Level-Decreasing Logic Programs , 1998, IWFM.

[2]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[3]  Giorgio Levi.  Advances in logic programming theory , 1995 .

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

[5]  Pascal Hitzler.  Topology and Logic Programming Semantics , 1997 .

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

[7]  Pascal Hitzler,et al.  Topology and Iterates in Computational Logic , 1997 .

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

[9]  S. Ginsburg,et al.  Acyclic logic programs and the completeness of SLDNF-resolution , 1991 .

[10]  A. Seda.  Topology And The Semantics Of Logic Programs , 1995 .

[11]  Lawrence Cavedon,et al.  Acyclic Logic Programs and the Completeness of SLDNF-Resolution , 1991, Theor. Comput. Sci..

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

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

[14]  Elena Marchiori.  A Methodology for Proving Termination of General Logic Programs , 1995, IJCAI.

[15]  Melvin Fitting,et al.  Metric Methods Three Examples and a Theorem , 1994, J. Log. Program..

[16]  Elena Marchiori.  On Termination of General Logic Programs w.r.t. Constructive Negation , 1996, J. Log. Program..

[17]  Pascal Hitzler,et al.  Characterizations of Classes of Programs by Three-Valued Operators , 1999, LPNMR.

[18]  Krzysztof R. Apt,et al.  Program verification and Prolog , 1995, Specification and validation methods.

[19]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[20]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

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