Partial deduction of logic programs wrt well-founded semantics

In this paper, we extend the partial deduction framework of Lloyd and Shepherdson, so that unfolding of non-ground negative literals and loop checks can be carried out during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.

[1]  Franco Turini,et al.  A Transformational Approach to Negation in Logic Programming , 1990, J. Log. Program..

[2]  John P. Gallagher,et al.  Specialisation of Prolog and FCP programs using abstract interpretation , 2009, New Generation Computing.

[3]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Mark Wallace,et al.  A Treatment of Negation during Partial Evaluation , 1989, META.

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

[6]  Teodor C. Przymusinski,et al.  Soundness and Completeness of Partial Deductions for Well-Founded Semantics , 1992, LPAR.

[7]  Jan Komorowski,et al.  Towards a Programming Methodology Founded on Partial Deduction , 1990, ECAI.

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

[9]  Krzysztof R. Apt,et al.  An Analysis of Loop Checking Mechanisms for Logic Programs , 1991, Theor. Comput. Sci..

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

[11]  John W. Lloyd,et al.  Partial Evaluation in Logic Programming , 1991, J. Log. Program..

[12]  Hisao Tamaki,et al.  Transformational Logic Program Synthesis , 1984, FGCS.

[13]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[14]  David Chan,et al.  An Extension of Constructive Negation and its Application in Coroutining , 1989, NACLP.

[15]  Peter J. Stuckey,et al.  Eliminating Negation from Normal Logic Programs , 1990, ALP.

[16]  John W. Lloyd,et al.  A Partial Evaluation Procedure for Logic Programs , 1990, NACLP.

[17]  Toramatsu Shintani,et al.  Deriving an Efficient Production System by Partial Evaluation , 1989, NACLP.

[18]  Teodor C. Przymusinski.  On Constructive Negation in Logic Programming , 1989, NACLP.

[19]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[20]  Mark Wallace,et al.  Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases , 1987, SLP.

[21]  Roland N. Bol,et al.  Loop checking in partial deduction , 1993, J. Log. Program..

[22]  Roland N. Bol.  Loop Checking and Negation , 1993, J. Log. Program..

[23]  Alan Bundy,et al.  Explanation-Based Generalisation = Partial Evaluation , 1988, Artif. Intell..

[24]  Hirohisa Seki,et al.  Unfold/Fold Transformation of General Logic Programs for the Well-Founded Semantics , 1993, J. Log. Program..