Skip to main content
SpringerLink
Log in

Tutorial notes: Reasoning about logic programs

  • Conference paper
  • First Online:
Book cover Logic Programming in Action (LPSS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 636))

Included in the following conference series:

I would like to thank the members of the mathematical reasoning group at Edinburgh and members of the CompuLog Network for helpful advice and feedback on these notes. In particular, Ina Kraan, Andrew Ireland, Helen Lowe, Danny De Schreye and Michael Maher were especially helpful. Special thanks are due to Ian Green and Andrew Ireland for getting the Springer LATEX style file to work. Some of the research reported in this paper was supported by Esprit BRA grant 3012 (CompuLog).

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. Bruynooghe, M. and De Schreye, D. (1986). Tutorial notes for: abstract interpretation in logic programming. Technical report, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, Tutorial given at ICLP-86, Seattle. Notes available from the authors. Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaaan 200A, 3001 Heverlee, Belgium.

    Google Scholar 

  2. Bundy, A., Smaill, A. and Hesketh, J. (1990). Turning eureka steps into calculations in automatic program synthesis. In Clarke, S.L.H., (ed.), Proceedings of UK IT 90, pages 221–6. Also available from Edinburgh as DAI Research Paper 448.

    Google Scholar 

  3. Bundy, A., Stevens, A., van Harmelen, F., Ireland, A. and Smaill, A. (1991). Rippling: A heuristic for guiding inductive proofs. Research Paper 567, Dept. of Artificial Intelligence, Edinburgh, To appear in Artificial Intelligence.

    Google Scholar 

  4. De Schreye, K. D. and Verschaetse. (1992). Termination of logic programs: Tutorial notes. Technical Report CW-report 148, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, To appear in the proceedings of Meta-92.

    Google Scholar 

  5. Deville, Y. (1990). Logic programming: systematic program development. Addison-Wesley Pub. Co.

    Google Scholar 

  6. Hogger, C.J. (1984). Introduction to logic programming. Academic Press.

    Google Scholar 

  7. Hogger, C.J. (1990). Essentials of Logic Programming. Oxford University Press.

    Google Scholar 

  8. Lloyd, J.W. (1987). Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, Second, extended edition.

    Google Scholar 

  9. Maher, M.J. (1987). Equivalences of logic programs. In Minker, J., (ed.), Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, Germany

    Alan Bundy

Authors
  1. Alan Bundy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Comyn N. E. Fuchs M. J. Ratcliffe

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bundy, A. (1992). Tutorial notes: Reasoning about logic programs. In: Comyn, G., Fuchs, N.E., Ratcliffe, M.J. (eds) Logic Programming in Action. LPSS 1992. Lecture Notes in Computer Science, vol 636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55930-2_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-55930-2_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55930-6

  • Online ISBN: 978-3-540-47312-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation