On the Relations between Acceptable Programs and Stratifiable Classes

Acceptable programs [4] play an important role when studying termination of logic programs, in the sense that this class matches the class of non-floundering left terminating programs. Moreover, various ways of defining semantics coincide for acceptable programs. In this paper, we study inclusion relations between this class and stratifiable classes, e.g. locally stratified [19,15], weakly stratified [14], effectively stratified [6], and support-stratified programs [9]. In particular, we show that every acceptable program is weakly stratified.

[1]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

[2]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

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

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

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

[6]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[7]  David W. Etherington.  Formalizing Nonmonotonic Reasoning Systems , 1987, Artif. Intell..

[8]  Artur S. d'Avila Garcez,et al.  Applying the connectionist inductive learning and logic programming system to power system diagnosis , 1997, Proceedings of International Conference on Neural Networks (ICNN'97).

[9]  Marc Bezem,et al.  Characterizing Termination of Logic Programs with Level Mappings , 1989, NACLP.

[10]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[11]  Christos H. Papadimitriou,et al.  Default Theories that Always Have Extensions , 1994, Artif. Intell..

[12]  Yannis Dimopoulos,et al.  Graph theoretical structures in logic programs and default theories , 1996 .

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

[14]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[15]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[16]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

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

[18]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

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