A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Problems and Experiments for and with Automated Theorem-Proving Programs
IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study
IEEE Transactions on Computers
IEEE Transactions on Computers
A Problem-Oriented Search Procedure for Theorem Proving
IEEE Transactions on Computers
Semantic Resolution for Horn Sets
IEEE Transactions on Computers
An Evaluation of an Implementation of Qualified Hyperresolution
IEEE Transactions on Computers
The Use of Higher Order Logic in Program Verification
IEEE Transactions on Computers
Methods for Automated Theorem Proving in Nonclassical Logics
IEEE Transactions on Computers
| Hi-index | 14.98 |
Automated theorem proving involves the programming of computers to perform logical (mathematical) deduction. This should not be confused with numerical calculation, in which operations that need to be performed can be exactly specified ahead of time as, for example, in Gaussian elimination. Rather, theorem provers search for proofs of statements given axioms describing the basic assumptions such as would occur in a modern algebra text on group theory. There are many theorem-proving programs that are based on ad hoc data representations and manipulations;many such techniques are derived by the programmer analyzing how he himself proves theorems. However, the most widely studied and best understood general method is based on the resolution principle for first-order logic of Robinson [9]. Indeed, all the papers in this issue have resolution as a starting point.