Skip to main content
SpringerLink
Log in

Partial deduction of logic programs wrt well-founded semantics

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Komorowski, J., “Towards a Programming Methodology Founded on Partial Deduction,” inProc. of the ECAI’90, Stockholm, Sweden, 1990.

  2. Prestwich, S. D., “Automatic Partial Evaluation,”Technical Report, TR-LP-54-00, ECRC, Germany, 1990.

    Google Scholar 

  3. Sahlin, D., “An Automatic Partial Evaluator for Full Prolog,”Ph.D. dissertation, Department of Telecommunication and Computer Systems, The Royal Institute of Technology, Stockholm, Sweden, 1991.

  4. Furukawa, K., Fujita, H., and Shintani, T., “Deriving an Efficient Production System by Partial Evaluation,” inProc. of the 1989 North American Conference on Logic Programming, Vol. 1 (Ewing L. Lusk and Ross A. Overbeek, eds.), MIT Press, pp. 661–674, 1989.

  5. Lloyd, J. W. and Shepherdson, J. C., “Partial Evaluation in Logic Programming,”Technical Report, No. CS-87-09, University of Bristol, U. K., 1987.

    Google Scholar 

  6. New Generation Computing, 6 (Special Issue—Selected papers from Workshop on Partial Evaluation and Mixed Computation), 1988.

  7. van Harmelen, F. and Bundy, A., “Explanation-Based Generalization=Partial Evaluation,”Artificial Intelligence, 36, pp. 401–412, 1989.

    Article  Google Scholar 

  8. Clark, K. L., “Negation as Failure,” inLogic and Databases (H. Gallaire and J. Minker, eds.), Plenum Press, New York, pp. 293–322, 1978.

    Google Scholar 

  9. Lloyd, J. W.,Foundations of Logic Programming, second extended edition, Springer-Verlag, 1987.

  10. Sato, T. and Tamaki, H., “Transformational Logic Program Synthesis,” inProc. of the International Conference on Fifth Generation Computer Systems, ICOT, Japan, pp. 195–201, 1984.

  11. Chan, D. and Wallace, M., “A Treatment of Negation during Partial Evaluation,” inMeta-Programming in Logic Programming (H. Abramson and M. H. Rogers, eds.), MIT Press, pp. 299–317, 1988.

  12. Bol, R. N., “Loop Checking in Partial Deduction,”The Journal of Logic Programming, 16, 1&2, pp. 25–46, 1993.

  13. Chan, D., “Constructive Negation Based on the Completed Database,” inProc. of the Fifth International Conference and Symposium on Logic Programming (R. A. Kowalski and K. A. Bowen, eds.), MIT Press, pp. 111–125, 1988.

  14. Chan, D., “An Extension of Constructive Negation and Its Application in Coroutining,” inProc. of the 1989 North American Conference on Logic Programming, Vol. 1 (Ewing L. Lusk and Ross A. Overbeek, eds.), MIT Press, pp. 477–493, 1989.

  15. Wallace, M., “Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases,”Technical Report, ECRC, Germany, 1987.

  16. Bol, R. N., Apt, K. R. and Klop, J. W., “An Analysis of Loop Checking Mechanisms for Logic Programs,”Theoretical Computer Science, 86, 1, pp. 35–79, 1991.

  17. Apt, K. R., Blair, H. A., and Walker, A., “Towards a Theory of Declarative Knowledge,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publisher Inc., pp. 89–148, 1988.

  18. Dung, P. M., “On the Relations between Stable and Well-Founded Semantics of Logic Programs,”Theoretical Computer Science, 105, pp. 7–25, 1992.

  19. Gelfond, M. and Lifschitz, V., “The Stable Model Semantics for Logic Programs,” inProc. of the 5th International Conf. Symp. on Logic Programming (R. A. Kowalski and K. A. Bowen, eds.), MIT Press, pp. 1070–1080, 1988.

  20. Przymusinski, T. C., “On the Declarative Semantics of Deductive Databases and Logic Programs,” inFoundations of Deductive Databases and Logic Programming (J. Minker, ed.), Morgan Kaufmann Publisher Inc., pp. 193–216, 1988.

  21. van Gelder, A., Ross, K. A., and Schlipf, J. S., “Unfounded Sets and Well-Founded Semantics for General Logic Programs,” inACM Symposium on Principles of Database Systems, ACM Press, pp. 221–230, 1988.

  22. Przymusinski, T. C., “On Constructive Negation in Logic Programming,” inProc. of the 1989 North Amerian Conference on Logic Programming (Ewing L. Lusk and Ross A. Overbeek, eds.), Addendum, MIT Press, 1989.

  23. Shepherdson, J. C., “Language and Equality Theory in Logic Programming,”Technical Report, No. PM/88/08. School of Mathematics, University of Bristol, U. K., 1988.

    Google Scholar 

  24. Gallagher, J., Codish, M., and Shapiro, E., “Specialisation of Prolog and FCP Programs Using Abstract Interpretation,”New Generation Computing, 6 (Special Issue —Selected papers from Workshop on Partial Evaluation and Mixed Computation), pp. 159–186, 1988.

  25. Benkerimi, K. and Lloyd, J. W., “A Partial Evaluation Procedure for Logic Programs,” inProc. of the 1990 North American Conference on Logic Programming (S. Debray and M. Hermenegildo, eds.), MIT Press, pp. 343–358, 1990.

  26. Ross, K. A., “A Procedural Semantics for Well Founded Negation in Logic Programs,”Technical Report, No. STAN-CS-88-1233, Stanford University, U.S.A., 1988.

    Google Scholar 

  27. Seki, H., “Unfold/Fold Transformation of Logic Programs for the Well-Founded Semantics,”The Journal of Logic Programming, 16, 1&2, pp. 5–23, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  28. Przymusinska, H., Przymusinski, T., and Seki, H., “Soundness and Completeness of Partial Deductions for Well-Founded Semantics,” inLogic Programming and Automated Reasoning (A. Voronkov, ed.), St. Petersburg, Russia, July 1192. (Lecture Notes in Artificial Intelligence, Vol. 624, Springer-Verlag, pp. 1–12, 1992).

  29. Bol, R. N., “Loop Checking and Negation,”The Journal of Logic Programming, 15, 1&2, pp. 147–175, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  30. Kanchanasut, K. and Stuckey, P. J., “Eliminating Negation from Normal Logic Programs,” inProc. of the Second Internatinal Conference on Algebraic and Logic Programming (H. Kirchner and W. Wechler, eds.), (LNCS 463), Springer-Verlag, pp. 217–231, 1990.

  31. Barbuti, R., Mancarella, P., Pedreschi, D., and Turini, F., “A Transformational Approach to Negation in Logic Programming,”The Journal of Logic Programming, 8, pp. 201–228, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  32. Lugiez, D., “A Deduction Procedure for First Order Programs,” inProc. of the 6th International Conference on Logic Programming (G. Levi and M. Martelli, eds.), MIT Press, pp. 585–599, 1989.

  33. Mancarella, P., Pedreschi, D., Rondinelli, M., and Tagliatti, M., “Algebraic Properties of a Class of Logic Programs,” inProc. of the 1990 North American Conference on Logic Programming (S. Debray and M. Hermenegildo, eds.), MIT Press, pp. 23–39, 1990.

  34. Dung, P. M., “Negation as Hypotheses: An Abductive Foundation for Logic Programming,” inProc. of the 8th International Conference on Logic Programming (K. Furukawa, ed.), MIT Press, pp. 3–17, 1991.

Download references

Author information

Authors and Affiliations

  1. Computer Science Program, School of Advanced Technologies, Asian Institute of Technology, P. O. Box 2754, 10501, Bangkok, Thailand

    Chandrabose Aravindan & Phan Minh Dung

Authors
  1. Chandrabose Aravindan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phan Minh Dung
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A short version of this paper appeared in theProceedings of the Third International Conference on Algebraic and Logic Programming, Volterra, Italy, September 1992.

Chandrabose Aravindan: He is a candidate for a doctoral degree in Computer Science at the Asian Institute of Technology (AIT), Bangkok, Thailand. He received his Master’s degree in 1990 from AIT, and Bachelor’s degree in 1986 from the Regional Engineering College, Tiruchirapalli, India. He is a member of the Association for Logic Programming (ALP), Interest Group in Pure and Applied Logic (IGPL), ACM, and IEEE (Computer Society). He is currently working on his dissertation on an abductive framework to capture the concepts of belief dynamics, and applying it to provide an axiomatic characterization for updates in databases. His research interests include program transformation, belief dynamics, non-monotonic reasoning, and databases.

Phan Minh Dung: He is currently an associate professor at the Asian Institute of Technology, Bangkok, Thailand. He received his Ph.D. in 1984 from the Dresden University, Germany, for his dissertation on structure and axioms of non-deterministic computations. His research interests include logic programming, non-monotonic reasoning, program transformation, concurrent and object-oriented computation, and deductive databases.

About this article

Cite this article

Aravindan, C., Dung, P.M. Partial deduction of logic programs wrt well-founded semantics. New Gener Comput 13, 45–74 (1994). https://doi.org/10.1007/BF03038308

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03038308

Keywords

Search

Navigation