Abstract
The expressiveness of the VIRT programming language from the viewpoint of theorem proving is discussed. A program of unit binary resolution is proposed. A comparative analysis of the programming languages VIRT and Lisp is performed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. I. Baranovskii, “VIRT: A universal programming language,” Kibern. Sist. Anal., No. 5, 130–150 (1998).
C. Chang and R. Lee, Symbolic Logic and Mechanical Theorem Proving [Russian translation], Nauka, Moscow (1983).
L. Sterling and E. Shapiro, The Art of Prolog: Advanced Programming Techniques [Russian translation], Mir, Moscow (1990).
S. Ceri, G. Gottlob, and L. Tanka, Logic Programming and Databases [Russian Translation], Mir, Moscow (1992).
Author information
Authors and Affiliations
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 87–99, November–December, 1999.
Rights and permissions
About this article
Cite this article
Baranovskii, A.I. Using the VIRT programming language for automatic theorem proving. Cybern Syst Anal 35, 918–929 (1999). https://doi.org/10.1007/BF02742284
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742284