## Resolution Theorem Proving

### Abstract

ground procedure. The first step in constructing the ground procedure is to convert inference problems to a simple normal form. 1 Clausal Normal Form Resolution is a refutation technique. To show that \Sigma j= \Phi resolution derives a contradiction from \Sigma [ f:\Phig. We will simply assume that we are given a finite set of formulas \Gamma and that we wish to show that \Gamma is unsatisfiable. The first step in resolution theorem proving is to put the formulas in \Gamma in a certain normal form. To define this normal form we need some additional terminology. Definition An atomic formula is either a proposition symbol, a predicate application of the form P (t 1 ; \Delta \Delta \Delta ; t n ), or an equation t 1 = t 2 between two terms. Definition A&lt;

Year: 1992
OAI identifier: oai:CiteSeerX.psu:10.1.1.43.2759
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
• http://citeseerx.ist.psu.edu/v... (external link)
• http://www.cs.biu.ac.il/~margo... (external link)

• To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.