Skip to main content
SpringerLink
Log in

Choices in, and limitations of, logic programming

  • Session 6b: Theory And Negation
  • Conference paper
  • First Online:
Third International Conference on Logic Programming (ICLP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 225))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise J. (ed.), Handbook of Mathematical Logic; North-Holland 1977.

    Google Scholar 

  2. Boyer R., Moore J., A Computational Logic; Academic Press, 1979.

    Google Scholar 

  3. Clark K., Negation as Failure. Logic and Data Bases (H. Gallaire ed.); Plenum Press 1978.

    Google Scholar 

  4. Clark K., Ennals J., McCabe F., A Micro-Prolog Primer. Logic Programming Associates Ltd, London 1981.

    Google Scholar 

  5. Clocksin W., Mellish C., Programming in Prolog, Springer Berlin 1981.

    Google Scholar 

  6. Colmerauer A., Kanoui H., Van Caneghem M., Prolog, Theoretical Principles and Current Trends; Technology and Science of Informatics, vol. 2, North Oxford Academic, 1983.

    Google Scholar 

  7. Hinman P., Recursion-Theoretic Hierarchies, Springer 1978.

    Google Scholar 

  8. Kleene S., Introduction to Meta-Mathematics; North Holland 1952.

    Google Scholar 

  9. Kleene S., Mathematical Logic; North Holland 1963.

    Google Scholar 

  10. LLoyd J., Foundations of Logic Programming; Springer Berlin 1984.

    Google Scholar 

  11. LLoyd J., Topor R., Making Prolog More Expressive; Journal of Logic Programming 1984 no. 3.

    Google Scholar 

  12. Naish L., An Introduction to MU-Prolog, Tech. Report Dept. of Comp. Science University of Melbourne, 1982.

    Google Scholar 

  13. Shoenfield J., Mathematical Logic, Addison-Wesley, 1967.

    Google Scholar 

  14. Takeuti G., Proof Theory; North Holland 1975.

    Google Scholar 

  15. Van Emden M., Kowalski R., The Semantics of Predicate Logic as a Programming Language; Journal of ACM, vol 23. 1976.

    Google Scholar 

  16. Voda P., Theory of Pairs, Part I: Provably Recursive Functions; Technical Report of Dept. Comp. Science UBC, Vancouver December 1984.

    Google Scholar 

  17. Voda P., A View of Programming Languages as Symbiosis of Meaning and Computations; New Generation Computing, Tokyo, February 1985.

    Google Scholar 

  18. Voda P.J., Computation of Full Logic Programs Using One-Variable Environments; New Generation Computing, vol.4 no. 2, May 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of British Columbia, V6T 1W5, Vancouver, B.C., Canada

    Paul J. Voda

Authors
  1. Paul J. Voda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ehud Shapiro

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Voda, P.J. (1986). Choices in, and limitations of, logic programming. In: Shapiro, E. (eds) Third International Conference on Logic Programming. ICLP 1986. Lecture Notes in Computer Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16492-8_110

Download citation

  • DOI: https://doi.org/10.1007/3-540-16492-8_110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16492-0

  • Online ISBN: 978-3-540-39831-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation