This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1976 (vol. 25 no. 7)
pp. 673-677
L. Yelowitz, Department of Computer Science, University of Pittsburgh
A concise matrix notation is introduced, leading to a very simple statement of the resolution principle of mechanical theorem proving in the propositional calculus. The refinements of general resolution can also be stated easily using this notation. In addition, the notation has lead to the development of three new techniques of theorem proving which are described and proved complete.
Index Terms:
AND/OR trees, completeness, covering problems, heuristics, mechanical theorem proving, resolution principle.
Citation:
L. Yelowitz, A. Kandel, "New Results and Techniques in Resolution Theory," IEEE Transactions on Computers, vol. 25, no. 7, pp. 673-677, July 1976, doi:10.1109/TC.1976.1674676
Usage of this product signifies your acceptance of the Terms of Use.