Filtern
Erscheinungsjahr
- 1999 (2)
Dokumenttyp
- Wissenschaftlicher Artikel (1)
- Preprint (1)
Sprache
- Englisch (2)
Volltext vorhanden
- ja (2)
Schlagworte
- tactics (2) (entfernen)
Fachbereich / Organisatorische Einheit
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.
We transform a user-friendly formulation of aproblem to a machine-friendly one exploiting the variabilityof first-order logic to express facts. The usefulness of tacticsto improve the presentation is shown with several examples.In particular it is shown how tactical and resolution theoremproving can be combined.