Advertisement

Partial deduction of logic programs WRT well-founded semantics

  • Chandrabose Aravindan
  • Phan Minh Dung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 632)

Abstract

In this paper, we extend the partial deduction framework of [LS] to unfold non-ground negative literals [ST,CW] and to include loop checks [B2] during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.

Key words

Partial deduction program transformation well-founded negation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABW]
    APT, K.R., BLAIR, H.A., & WALKER, A. (1988), Towards a theory of declarative knowledge, In: Foundations of deductive databases and logic programming, (Ed.) Minker, J., pp. 89–148, Morgan Kaufmann Publisher Inc.Google Scholar
  2. [AD]
    ARAVINDAN, C. & DUNG, P.M. (1992), Partial deduction of logic programs wrt well-founded semantics, Technical Report, Division of computer science, Asian Institute of Technology, Bangkok, Thailand.Google Scholar
  3. [B1]
    BOL, R.N. (1990), Loop checking and negation, Technical Report CS-R9075, Centre for mathematics and computer science, Amsterdam, The Netherlands.Google Scholar
  4. [B2]
    BOL, R.N. (1991), Loop checking in partial deduction, Technical Report, Centre for mathematics and computer science, Amsterdam, The Netherlands.Google Scholar
  5. [BAK]
    BOL, R.N., APT, K.R., & KLOP, J.W. (1991), An analysis of loop checking mechanisms for logic programs, Technical Report CS-R8942, Centre for mathematics and computer science, Amsterdam, The Netherlands.Google Scholar
  6. [BL]
    BENKERIMI, K. & LLOYD, J. W. (1989), A Procedure for the Partial Evaluation of Logic Programs, Tech. Rep. No. TR-89-04, University of Bristol, U.K.Google Scholar
  7. [BMPT]
    BARBUTI, R., MANCARELLA, P., PEDRESCHI, D., and TURINI, F. (1990), A Transformational Approach to Negation in Logic Programming, The Journal of Logic Programming 8, pp. 201–228, Elsevier Science Publishing Co.Google Scholar
  8. [C]
    CLARK, K.L. (1978), Negation as Failure, In: Logic and Databases, (Eds.) Gallaire, H. & Minker, J., pp. 293–322, Plenum press, New York.Google Scholar
  9. [Ch1]
    CHAN, D. (1988), Constructive Negation Based On The Completed Database, Technical Report TR-LP-31, ECRC, Germany.Google Scholar
  10. [Ch2]
    CHAN, D. (1989), An extension of Constructive negation and its application in coroutining, Technical Memo HPL-ISC-TM-89-037, Hewlett-Packard Laboratories, Bristol, U.K.Google Scholar
  11. [CW]
    CHAN, D. & WALLACE, M. (1988), A treatment of Negation during Partial Evaluation, In: Meta-programming in Logic Programming, (Eds.) Abramson, H. & Rogers, M.H., pp. 299–317, MIT Press.Google Scholar
  12. [D]
    DUNG, P.M. (1992), On the relations between stable and well-founded semantics of logic programs, To appear in Theoretical Computer Science (Vol. 105, Feb, 1993).Google Scholar
  13. [FFS]
    FURUKAWA, K., FUJITA, H., & SHINTANI, T. (1989), Deriving an Efficient Production System by Partial Evaluation, In: Proc. of North American Conference on Logic Programming (Vol. 1), (Eds.) Ewing L. Lusk & Ross A. Overbeek, MIT Press.Google Scholar
  14. [GCS]
    GALLAGHER, J., CODISH, M.,& SHAPIRO, E. (1988), Specialization of Prolog and FCP programs using abstract interpretation, NGC: Special Issue — Selected papers from workshop on Partial Evaluation and Mixed Computation, 1987, pp. 159–186, OHMSHA Ltd. and Springer-Verlag.Google Scholar
  15. [GL]
    GELFOND, M. & LIFSCHITZ, V. (1988), The stable model semantics for logic programs, In: Proc. of the 5th International Conf/Symp on Logic Programming, (Eds.) Kowalski, R.A. & Bowen, K.A., pp. 1070–1080, MIT Press.Google Scholar
  16. [K]
    komorowski, J. (1990), Towards a Programming Methodology Founded on Partial Deduction, In: Proc. of the ECAI'90, Stockholm, Sweden.Google Scholar
  17. [KS]
    KANCHANASUT, K. & STUCKEY, P.J. (1990), Eliminating Negation from Normal Logic Programs, In: Proc. of the Second International Conference on Algebraic and Logic Programming, (Eds.) Kirchner, H. & Wechler, W., LNCS 463, pp. 217–231, Springer-Verlag.Google Scholar
  18. [L]
    LLOYD, J.W. (1987), Foundations of Logic Programming, Second Extended Edition, Springer-Verlag.Google Scholar
  19. [Lu]
    LUGIEZ, D. (1989), A deduction procedure for first order programs, In: Proc. of the 6th International Conference on Logic Programming, (Eds.) Levi, G. and Martelli, M., pp. 585–599, MIT Press.Google Scholar
  20. [LS]
    LLOYD, J.W. & SHEPHERDSON, J.C. (1987), Partial Evaluation in Logic Programming, Tech. Rep. No. CS-87-09, University of Bristol, U.K.Google Scholar
  21. [MPRT]
    MANCARELLA,P., PEDRESCHI,D., RONDINELLI,M., & TAGLIATTI,M. (1990), Algebraic Properties of a class of logic programs, In: Proc. of the 1990 North American Conference on Logic Programming, (Eds.) Debray, S. & Hermenegildo, M., pp. 23–39, MIT Press.Google Scholar
  22. [NGC]
    New Generation Computing: Special Issue — Selected papers from workshop on Partial Evaluation and Mixed Computation, 1987, OHMSHA Ltd. and Springer-Verlag.Google Scholar
  23. [P]
    PRESTWICH, S.D. (1990), Automatic Partial Evaluation,Technical Report TR-LP-54-00, ECRC, Germany.Google Scholar
  24. [Pr1]
    PRZYMUSINSKI, T.C. (1988), On the declarative semantics of deductive databases and logic programs, In: Foundations of deductive databases and logic programming, (Ed.) Minker, J., pp. 193–216, Morgan Kaufmann Publisher Inc.Google Scholar
  25. [Pr2]
    PRZYMUSINSKI, T.C. (1990), On Constructive Negation in Logic Programming, Technical Report, University of Texas at El Paso, U.S.A.Google Scholar
  26. [PP]
    PRZYMUSINSKA, H. & PRZYMUSINSKI, T.C. (1988), Weakly perfect model semantics for logic programs, In: Proc. of the 5th International Conf/Symp on Logic Programming, (Eds.) Kowalski, R.A. & Bowen, K.A., pp. 1106–1120, MIT Press.Google Scholar
  27. [R]
    ROSS, K.A. (1988), A Procedural Semantics for Well Founded Negation in Logic Programs, Tech. Rep. No. STAN-CS-88-1233, Stanford University, U.S.A.Google Scholar
  28. [S]
    SAHLIN, D. (1991), An automatic partial evaluator for full Prolog, Ph.D. Dissertation, Dept. of Telecommunication and Computer Systems, The Royal Institute of Technology, Stockholm, Sweden.Google Scholar
  29. [Sh]
    SHEPHERDSON, J. C. (1988), Language and Equality Theory in Logic Programming, Technical Report No. PM/88/08, School of Mathematics, University of Bristol, U.K.Google Scholar
  30. [ST]
    SATO, T. & TAMAKI, H. (1984), Transformational Logic Program Synthesis, In: Proc. of the International Conference on Fifth Generation Computer Systems, (Eds.) ICOT, pp. 195–201, ICOT, Japan.Google Scholar
  31. [VB]
    VAN HARMELEN, F. & BUNDY, A. (1988), Explanation-Based Generalization = Partial Evaluation, Artificial Intelligence 36, pp. 401–412.Google Scholar
  32. [VRS]
    VAN GELDER, A., ROSS, K.A & SCHLIPF, J.S. (1989), Unfounded Sets and Well-Founded Semantics for General Logic Programs, Technical Report UCSC-CRL-89-38, University of California at Santa Cruz, U.S.A.Google Scholar
  33. [W]
    WALLACE, M. (1987), Negation By Constraints: A Sound and Efficient Implementation of negation in Deductive Databases, Technical Report, ECRC, Germany.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Chandrabose Aravindan
    • 1
  • Phan Minh Dung
    • 1
  1. 1.Division of Computer ScienceAsian Institute of TechnologyBangkokThailand

Personalised recommendations