Skip to main content
SpringerLink
Log in

Logic programming and Σ-programming

  • Published:
Cybernetics Aims and scope

Abstract

We consider the main similarities and dissimilarities between logic programming and Σ-programming. Particular emphasis is placed on efficient implementation of Σ-programs. Algorithms that translate logic programs into Σ-programs and back are given.

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.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. S. S. Lavrov and P. S. Silagadze, Automatic Data Processing. The Language Lisp and Its Implementation [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  2. Basic Refal and Its Computer Implementation (Methodological Recommendations) [in Russian], TsNIPIASS, Moscow (1977).

  3. R. M. Burstall, D. B. MacQueen, and D. T. Sanella, Hope — An Experimental Applicative Language, Dept. of Computer Sci. Report No. 23, Univ. of Edinburgh (1980).

  4. D. A. Turner, SASL Language Manual, Dept. of Computer Sci. Report, Univ. of Kent (1983).

  5. D. A. Turner, “Miranda: a nonstrict functional language with polymorphic types,” Lect. Notes Comput. Sci., Vol. 206, 1–16 (1980).

    Google Scholar 

  6. W. Clocksin and C. Mellish, Programming in Prolog, Springer, Berlin (1984).

    Google Scholar 

  7. I. Bratko, Prolog Programming for Artificial Intelligence, Addison-Wesley, Reading, Mass. (1986).

    Google Scholar 

  8. A. A. Markov and N. M. Nagornyi, Theory of Algorithms [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  9. H. Barendregt, Lambda-Calculus [Russian translation], Nauka, Moscow (1985).

    Google Scholar 

  10. J. Hughes, Graph Reduction with Super-Combinators, Tech. Report No. 23, Oxford Univ. (1982).

  11. S. S. Goncharov and D. I. Sviridenko, “Σ-programming,” Vychisl. Sistemy, No. 107, 3–29 (1985).

    Google Scholar 

  12. J. Barwise, Admissible Sets and Structures, Springer, Berlin (1975).

    Google Scholar 

  13. Yu. L. Ershov, “Dynamic logic over admissible sets,” Dokl. Akad. Nauk SSSR,273, No. 5 1045–1048 (1983).

    Google Scholar 

  14. A. A. Voronkov, “A natural calculus for Σ-programs,” Vychisl. Sistemy, No. 120, 14–23 (1987).

    Google Scholar 

  15. J. Coguen and H. Messeguer, “Models and equality for logic programming,” J. Logic. Prog., No. 1, 1–19 (1986).

    Google Scholar 

  16. Yu. L. Ershov, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  17. K. L. Clark, The Synthesis and Verification of Logic Programs, Res. Report No. 23, Imp. College Sci. Tech., London (1977).

    Google Scholar 

  18. K. L. Clark and S. Sickel, “Predicate logic: a calculus for deriving programs,” Proc. 5th Int. Joint Conf. on Artificial Intelligence, Cambridge, Mass. (1977), pp. 517–525.

  19. K. L. Clark and J. Darlington, “Algorithm classifications through synthesis,” Comput, J.,23, No. 1, 61–65 (1980).

    Google Scholar 

  20. C. J. Hogger, Introduction to Logic Programming Academic Press, London (1984).

    Google Scholar 

  21. T. Sato and H. Tamaki, “Transformational logic program synthesis,” Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo (1984), pp. 195–201.

Download references

Authors
  1. A. A. Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 67–72, January–February, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voronkov, A.A. Logic programming and Σ-programming. Cybern Syst Anal 25, 83–91 (1989). https://doi.org/10.1007/BF01074888

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation