Methods for Automated Theorem Proving in Nonclassical Logics

Authors:
C. G. Morgan
Affiliations:
Department of Philosophy, University of Victoria
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 3
Cited 4

Fuzzy Logic and the Resolution Principle

Journal of the ACM (JACM)
Unit Refutations and Horn Sets

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Introduction Tutorial on Resolution

IEEE Transactions on Computers
Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques

IEEE Transactions on Computers
The philosophy of automated theorem proving

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	14.99

Visualization

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.