Title :
New Results and Techniques in Resolution Theory
Author :
Yelowitz, Lawrence ; Kandel, Abraham
Author_Institution :
Department of Computer Science, University of Pittsburgh
fDate :
7/1/1976 12:00:00 AM
Abstract :
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.
Keywords :
AND/OR trees, completeness, covering problems, heuristics, mechanical theorem proving, resolution principle.; Application software; Calculus; Computer science; Logic; AND/OR trees, completeness, covering problems, heuristics, mechanical theorem proving, resolution principle.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1976.1674676
