## Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (long version) (1997)

Citations: | 5 - 0 self |

### BibTeX

@MISC{Peltier97simplifyingand,

author = {Nicolas Peltier},

title = {Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (long version)},

year = {1997}

}

### OpenURL

### Abstract

. A powerful extension of the tableau method is described. It consists in a new simplification rule allowing to prune the search space and a new way of extracting a model from a given (possibly infinite) branch. These features are combined with a former method for simultaneous search for refutations and models. The possibilities of the new method w.r.t. the original one are clearly stated. In particular it is shown that the method is able to build model for each formula having a model expressible by equational constraints. 1. Introduction The construction and the use of models or counter-examples are crucial techniques widely used in all aspects of human reasoning. In mathematics, models allow the rejection of false conjectures or help to prove theorems. Incorporating such abilities into automated theorem provers is therefore a very natural idea, which has been considered since the beginning [15, 25]. Nevertheless, it is not until the nineties that feasible methods have been proposed ...