## Reformulating Resolution Problems by Tactics

• A straightforward formulation of a mathematical problem is mostly not ad-equate for resolution theorem proving. We present a method to optimize suchformulations by exploiting the variability of first-order logic. The optimizingtransformation is described as logic morphisms, whose operationalizations aretactics. The different behaviour of a resolution theorem prover for the sourceand target formulations is demonstrated by several examples. It is shown howtactical and resolution-style theorem proving can be combined.

### Additional Services

Author: Manfred Kerber, Axel Präcklein urn:nbn:de:hbz:386-kluedo-2434 Article English 1999 1999 Technische Universität Kaiserslautern 2000/04/03 problem formulation ; resolution ; tactics ; theorem proving Fachbereich Informatik 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$