A major event in automated reasoning was the introduction by Robinson of resolution as an inference principle that is complete for the first-order predicate calculus. Here the theory of binaryâ€¦ (More)

We p r e s e n t and a n a l y s e e x p e r i m e n t a l r e s u l t s i n t h e f i r s t e x t e n s i v e use o f a theo rem p r o v e r based o n R e s o l u t i o n b y U n i f i c a t i o nâ€¦ (More)

This paper defines rules of inference which incorporate the axioms of equality into a new definition of binary resolution which is based on equality as well as unification. These inference rules areâ€¦ (More)

RUE resolution represents a reformulation of binary resolution so that the basic rules of inference (RUE and NRF) incorporate the axioms of equality. An RUE theorem prover has been implemented andâ€¦ (More)

I n equa l i t y -based b ina ry r e s o l u t i o n , the v i a b i l i t y t e s t is used as a d e c i s i o n mechanism to s e l e c t disagreement sets and a lso to de f i ne the RUE u n i f i eâ€¦ (More)

In this paper we discuss the successful execution of the LIM+ challenge problems as proposed by Bledsoe. This problem set ranges from a 12-step nonequality proof to a complex 41-step paramodulationâ€¦ (More)

In assess ing the power of a theorem p rove r , we should s e l e c t a theorem d i f f i c u l t to prove, compare the q u a l i t y o f p r o o f w i t h the pub l i shed work of mathemat i c i a nâ€¦ (More)