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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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 appear
Gabbay, D.M. & U. Reyle: N-Prolog. Part 1. In: Journal of Logic Programming 1 (1984), p.319–355
Gabbay, D.M.: N-Prolog. Part 2. In: Journal of Logic Programming 2 (1985), p.251–285
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
Gabbay, D.M. & U. Reyle: N-Prolog. Part 3 — Computation with Run Time Skolemization. Technical report, Imperial College 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hudelmaier, J. (1991). A decision procedure for propositional N-Prolog. In: Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1989. Lecture Notes in Computer Science, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038697
Download citation
DOI: https://doi.org/10.1007/BFb0038697
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53590-4
Online ISBN: 978-3-540-46879-0
eBook Packages: Springer Book Archive