Refine
Year of publication
- 1999 (1)
Document Type
- Article (1) (remove)
Language
- English (1) (remove)
Has Fulltext
- yes (1)
Keywords
- problem formulation (1) (remove)
Faculty / Organisational entity
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.