Skip to main content
SpringerLink
Log in
Book cover

ALPUK92 pp 253–262Cite as

Logic Programming via Proof-valued Computations

  • Conference paper

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

We argue that the computation of a logic program can be usefully divided into two distinct phases: the first being a proof-valued computation or proof-search; the second a residual computation, or answer extraction. Extension of extraction techniques to various theories then permits more extensive languages and proof procedures to be employed for the computational solution of problems.

We illustrate these ideas with a simple propositional logic and show that SLD-resolution computes presentations of proofs in which the residual computation may be interleaved with the proof-search, whereas a more general proof procedure yields shorter presentations of (the same) proofs, but which require more extensive residual computations.

This work was supported in part by ESPRIT BRA, “Logical Frameworks”; and U.K. SERC grant GR/G 58588, “Logical and Semantical Frameworks”.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.L. Constable et al. Implementing mathematics with the NuPRL proof development system. Prentice Hall, 1986.

    Google Scholar 

  2. J.-Y. Girard. Linear logic. Theoret. Comput. Sci., 50(1), 1987.

    Google Scholar 

  3. K. Gödel. Uber eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, 12, 1958, pp.280–287; English translation, J. Phil. Logic, 9, 1980, pp. 133–142.

    Article  MATH  Google Scholar 

  4. R. Harper, F. Honsell, G. Plotkin. A framework for defining logics. J. ACM, (to appear). (Preprint available as University of Edinburgh LFCS report ECS-LFCS-91–162, June 1991.)

    Google Scholar 

  5. S.C. Kleene. Permutability of inferences in Gentzen’s calculi LK and LJ. Mem. Amer. Math. Soc, pages 1–26, 1952.

    Google Scholar 

  6. S.C. Kleene. Mathematical Logic. Wiley and Sons, 1968.

    Google Scholar 

  7. R. Kowalski and D. Kuehner. Linear resolution with selection function. J. Ariif. Int., 2:227–260, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.

    Book  MATH  Google Scholar 

  9. D.W. Loveland. Automated theorem proving: a logical basis. Elsevier, 1979.

    Google Scholar 

  10. P. Martin-Löf. On the meanings of the logical constants and the justifications of the logical laws. Technical Report 2, Scuola di Specializziazione in Logica Matematica, Dipartimento di Matematica, Università di Siena, 1985.

    Google Scholar 

  11. D. Miller and G. Nadathur. Higher-order Logic Programming. Report MS-CIS-86–17, University of Pennsylvania, 1986.

    Google Scholar 

  12. D. Miller, G. Nadathur, A. Scedrov and F. Pfenning. Uniform Proofs as a Foundation for Logic Programming. Ann. Pure and Appl. Logic, 51, pp. 125–157, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  13. F. Pfenning. Logic programming in the LF logical framework. In: Logical Frameworks, G. Huet and G. Plotkin (editors), Cambridge University Press, 1991. pp. 149–181.

    Chapter  Google Scholar 

  14. D. Prawitz. Natural deduction: a proof-theoretical study. Almqvist & Wiksell, 1965.

    MATH  Google Scholar 

  15. D. Prawitz. Proofs and the meaning and completeness of the logical constants. In: J. Hintikka, I. Niiniluoto and E. Saarinen (eds.) Essays on Mathematical and Philosophical Logic, pp. 25–40. D. Reidel, 1978.

    Google Scholar 

  16. D.J. Pym. Proofs, Search and Computation in General Logic. Ph.D. thesis, University of Edinburgh, 1990. Available as report CST-69–90, Department of Computer Science, University of Edinburgh, 1990. (Also published as LFCS report ECS-LFCS-90–125.)

    Google Scholar 

  17. D.J. Pym and L.A. Wallen. Proof-search in the All-calculus. In: Logical Frameworks, G. Huet and G. Plotkin (editors), Cambridge University Press, 1991. pp. 309–340.

    Chapter  Google Scholar 

  18. W. Sieg. Herbrand analyses. Arch. Math. Logic, 30, pp. 409–441, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  19. J. Zucker. The correspondence between cut-elimination and normalisation. Ann. Math. Logic, 7:1–112, 1974.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Edinburgh, Scotland, UK

    David J. Pym

  2. University of Oxford, England, UK

    Lincoln A. Wallen

Authors
  1. David J. Pym
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lincoln A. Wallen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College of Science, Technology and Midicine, 180 Queen’s Gate, SW7 2BZ, London, UK

    Krysia Broda BSc, MSc, PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Pym, D.J., Wallen, L.A. (1993). Logic Programming via Proof-valued Computations. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3421-3_14

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3421-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation