Methods for Automated Theorem Proving in Nonclassical Logics
 |
 |
abstract = {In this paper we outline two basic methods for automated theorem proving in nonclassical logics, including modal, many-valued, relevance, and intuitionistic logics. We discuss advantages and disadvantages of each method and give several illustrative examples. We outline a procedure for attacking more complex problems using a combination of the two basic methods. Results of experimental applications of the techniques are reported.},
apice = {AtpnclIeeetc25},
author = {Charles G. Morgan},
doi = {10.1109/TC.1976.1674704},
eissn = {1557-9956},
issn = {0018-9340},
journal = {IEEE Transactions on Computers},
month = aug,
number = 8,
numpages = 11,
openalex = {W2035490172},
pages = {852--862},
publisher = {IEEE},
title = {Methods for Automated Theorem Proving in Nonclassical Logics},
url = {http://ieeexplore.ieee.org/document/1674704/},
volume = {C-25},
year = 1976
}