Affiliation:
1. Stanford Univ., Stanford, CA
2. SRI International, Menlo Park, CA
Abstract
Two deduction rules are introduced to give streamlined treatment to relations of special importance in an automated theorem-proving system. These rules, the
relation replacement
and
relation matching
rules, generalize to an arbitrary binary relation the paramodulation and E-resolution rules, respectively, for equality, and may operate within a nonclausal or clausal system. The new rules depend on an extension of the notion of
polarity
to apply to subterms as well as to subsentences, with respect to a given binary relation. The rules allow us to eliminate troublesome axioms, such as transitivity and monotonicity, from the system; proofs are shorter and more comprehensible, and the search space is correspondingly deflated.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference18 articles.
1. Proving theorems with the modification method;BRAND D;SlAM J. Comput.,1975
2. DIGRICOLI V. Resolution by Unification and Equality. Ph.D. dissertation New York Univ. New York N.Y. 1983.]] DIGRICOLI V. Resolution by Unification and Equality. Ph.D. dissertation New York Univ. New York N.Y. 1983.]]
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献