Abstract

The paper ivestigates nite model building for rst order logic. We consider two main categories of methods: Mace-type and Falcontype methods. The paper has two goals: rst, presenting several improvements and strategies for the basic Mace-type and Falcon-type algorithms, second, comparing the eciency of dierent methods. The improvements to the Mace-type algorithms are focused on decreasing the size of the propositional subtasks. A new cell selection heuristics is introduced for the Falcon-type algorithms. The methods are implemented in the Gandalf theorem prover. We present both the eect of the introduced improvements and the comparison of method categories for several problem classes, based on their syntactical characteristics. Finally, several suggestions for further investigations are given.

Citations