Advertisement

A decision procedure for propositional N-Prolog

  • Jörg Hudelmaier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 475)

Abstract

The purpose of this paper is to present a Gentzen style formulation for the fragment of intuitionistic propositional logic having only conjunction and implication, capturing the spirit of Gabbay's goal directed theorem prover for this logic [1], later modified into N-Prolog (cf.[2]), which, however, does not need loop checking.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gabbay, D.M.: Theory of Algorithmic Proof. In: Handbook of Logic in Theoretical Computer Science, vol. 1, ed. by Gabbay, D.M. & T.S.E. Maibaum, Oxford, to appearGoogle Scholar
  2. [2]
    Gabbay, D.M. & U. Reyle: N-Prolog. Part 1. In: Journal of Logic Programming 1 (1984), p.319–355Google Scholar
  3. [3]
    Gabbay, D.M.: N-Prolog. Part 2. In: Journal of Logic Programming 2 (1985), p.251–285Google Scholar
  4. [4]
    Gabbay, D.M. & F. Kriwaczek: A Goal Directed Theorem Prover for Intuitionistic and Intermediate Logics, Based on Conjunctions and Implications. To appear in Journal of Automated Reasoning Google Scholar
  5. [5]
    Gabbay, D.M. & U. Reyle: N-Prolog. Part 3 — Computation with Run Time Skolemization. Technical report, Imperial College 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jörg Hudelmaier
    • 1
  1. 1.CIS, Universität MünchenMünchen

Personalised recommendations