A decision procedure for propositional N-Prolog
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 , later modified into N-Prolog (cf.), which, however, does not need loop checking.
Unable to display preview. Download preview PDF.
- 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
- Gabbay, D.M. & U. Reyle: N-Prolog. Part 1. In: Journal of Logic Programming 1 (1984), p.319–355Google Scholar
- Gabbay, D.M.: N-Prolog. Part 2. In: Journal of Logic Programming 2 (1985), p.251–285Google Scholar
- 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
- Gabbay, D.M. & U. Reyle: N-Prolog. Part 3 — Computation with Run Time Skolemization. Technical report, Imperial College 1987Google Scholar