Skip to main content
SpringerLink
Log in

A Tutorial on Proof Theoretic Foundations of Logic Programming

  • Conference paper
Logic Programming (ICLP 2003)

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

Included in the following conference series:

Abstract

Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logic programming languages, endowed with a rich meta theory. This tutorial intends to expose the main ideas of this discipline in the most direct and simple way.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gallier, J.: Constructive logics, Part I: A tutorial on proof systems and typed λ-calculi. Theoretical Computer Science 110, 249–339 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68–131. North-Holland, Amsterdam (1969)

    Google Scholar 

  3. Miller, D.: Documentation for lambda prolog, http://lPrologdocs.html

  4. Miller, D.: Overview of linear logic programming. In: Ehrhard, T., Girard, J.-Y., Ruet, P., Scott, P. (eds.) Accepted as a chapter for a book on linear logic, Cambridge University Press, Cambridge, http://papersllp.pdf http://papersllp.pdf

  5. Miller, D.: A multiple-conclusion meta-logic. In: Abramsky, S. (ed.) Ninth Annual IEEE Symp. on Logic in Computer Science, Paris, July 1994, pp. 272–281 (1994)

    Google Scholar 

  6. Miller, D.: Forum: A multiple-conclusion specification logic. Theoretical Computer Science 165, 201–232 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125–157 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Nadathur, G., Miller, D.: Higher-order Horn clauses. Journal of the ACM 37(4), 777–814 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Dresden, Hans-Grundig-Str. 25, 01062, Dresden, German

    Paola Bruscoli & Alessio Guglielmi

Authors
  1. Paola Bruscoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessio Guglielmi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruscoli, P., Guglielmi, A. (2003). A Tutorial on Proof Theoretic Foundations of Logic Programming. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation