Geometric Resolution: A Proof Procedure Based on Finite Model Search

We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on geometric formulas. For this reason we call the procedure geometric resolution. We expect that the procedure can be used as an efficient proof search procedure for firstorder logic. In addition, the procedure can be implemented in such a way that it is complete for finding finite models.

• Type: Conference
• Year: 2006
• Where: CADE
• Authors: Hans de Nivelle, Jia Meng
• Keywords: Automated Reasoning, CADE 2006, Procedure Geometric Resolution, Proof Procedure, Proof Search Procedure