Abstract
A generalization of conventional Horn clause logic programming is proposed in which the space of truth values is a pseudo-Boolean or Heyting algebra, whose members may be thought of as evidences for propositions. A minimal model and an operational semantics is presented, and their equivalence is proved, thus generalizing the classic work of Van Emden and Kowalski.
References
M. C. Fitting, Computability Theory, Semantics, and Logic Programming, Oxford University Press, New York, 1987.
L. T. McCarthy, Fixed Point Semantics and Tableau Proof Procedures for a Clausal Intuitionistic Logic, Technical Report LRP-TR-18, Rutgers University, 1986.
L. T. McCarthy, Clausal intuitionistic logic: an outline, submitted to Journal of Automated Reasoning, 1986.
D. A. Miller, A Theory of modules for logic programs, Proceedings, 1986 IEEE Symposium on Logic Programming, 1986.
H. Rasiowa and R. Sikorski, The Mathematics of Metamathematics, second edition, PWN — Polish Scientific Publishers, Warsaw 1968.
M. Van Emden and R. Kowalski, The Semantics of predicate logic as a programming language, Journal of the Association for Computing Machinery, Vol. 23, pp. 733–742, 1976.
Author information
Authors and Affiliations
Additional information
Research supported by PSC-CUNY Grants 666396, 667295 and NSF Grant CCR-8702307.
Rights and permissions
About this article
Cite this article
Fitting, M. Pseudo-Boolean valued prolog. Stud Logica 47, 85–91 (1988). https://doi.org/10.1007/BF00370283
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370283