Skip to main content
SpringerLink
Log in

A family of goal directed theorem provers based on conjunction and implication: Part 1

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This paper presents a family of theorem provers for classical, intuitionistic and neighbouring logics. The theorem provers are based on a formulation of these logics in terms of conjunction, implication and falsity. Computation is goal directed, and, for the special case of Horn clauses, coincides with pure Prolog computation. Our approach is generic, and, as we shall show in a subsequent paper, can be adapted to other logics, such as modal and temporal systems.

The research described in this paper has been funded partially by Esprit project No. 393, ‘ACORD’, of the European Commission.

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

References

  1. Broda, K., Ph.D. Thesis, Department of Computing, Imperial College, London (to appear).

  2. Broda K., Gabbay D. M., and Kriwaczek F., ‘A goal directed theorem prover for classical logic’. Research Report, Department of Computing, Imperial College, London (1984).

    Google Scholar 

  3. Gabbay D. M.,Semantical Investigations in Heyting's Instituionistic Logic, D. Reidel, Dordrecht (1981).

    Google Scholar 

  4. Gabbay D. M., ‘Elementary logic — a procedural approach’, Lecture Notes, Department of Computing, imperial College, London (1984).

    Google Scholar 

  5. Gabbay D. M., ‘N-Prolog — Part 2’,J. Logic Programming,2, 251–283 (1985).

    Google Scholar 

  6. Gabbay, D. M., ‘Modal and temporal logic programming’ in Galton, A. (ed.),Temporal Logics and Their Applications, Academic Press, pp. 197–237 (1986).

  7. Gabbay D. M., ‘Elements of algorithmic proof’. Research Report, Department of Computing, Imperial College, London (1988). To appear in Abramsky, S., D. Gabbay and T. Maibaum (eds.),Handbook of Logic in Theoretical Computer Science, Oxford University Press.

    Google Scholar 

  8. Gabbay, D. M., and Reyle, U., ‘Computation with run-time Skolemization’.Applied Non-Classical Logics (to appear).

  9. Loveland, D. W., ‘Near Horn Prolog’. Research Report CS 1987-14, Department of Computer Science, Duke University (1977).

  10. Gabbay, D. M., ‘Algorithmic Proof with diminishing resources’,Proc. CSL 90,Springer-Verlag (to appear).

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College of Science and Technology, 180 Queen's Gate, SW7 2BZ, London, U.K.

    Dov M. Gabbay & Frank Kriwaczek

Authors
  1. Dov M. Gabbay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Kriwaczek
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabbay, D.M., Kriwaczek, F. A family of goal directed theorem provers based on conjunction and implication: Part 1. J Autom Reasoning 7, 511–536 (1991). https://doi.org/10.1007/BF01880327

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Search

Navigation