## Automated Deduction by Theory Resolution (1985)

Venue: | Journal of Automated Reasoning |

Citations: | 121 - 1 self |

### BibTeX

@ARTICLE{Stickel85automateddeduction,

author = {Mark E. Stickel},

title = {Automated Deduction by Theory Resolution},

journal = {Journal of Automated Reasoning},

year = {1985},

volume = {1},

pages = {333--355}

}

### Years of Citing Articles

### OpenURL

### Abstract

Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can greatly reduce the length of proofs and the size of the search space. Theory resolution effects a beneficial division of labor, improving the performance of the theorem prover and increasing the applicability of the specialized reasoning procedures. Total theory resolution utilizes a decision procedure that is capable of determining unsatisfiability of any set of clauses using predicates in the theory. Partial theory resolution employs a weaker decision procedure that can determine potential unsatisfiability of sets of literals. Applications include the building in of both mathematical and special decision procedures, e.g., for the taxonomic information furnished by a knowledge representation system. Theory resolution is a generalization of numerous previously known resolution refinements. Its power is demonstrated by comparing solutions of "Schubert's Steamroller" challenge problem with and without building in axioms through theory resolution. 1 1