Program Tactics and Logic Tactics

Fausto Giunchiglia, Paolo Traverso

Abstract: In this paper we present a first order classical metatheory, called MT, with the following properties: (1) tactics are terms of the language of MT (we call these tactics,Logic Tactics); (2) there exists a mapping between Logic Tactics and the tactics developed as programs within the GETFOL theorem prover (we call these tactics,Program Tactics). MT is expressive enough to represent the most interesting tacticals, i.e.,then, orelse, try, progress andrepeat. repeat allows us to express Logic Tactics which correspond to Program Tactics which may not terminate. This work is part of a larger project which aims at the development and mechanization of a metatheory which can be used to reason about, extend and, possibly, modify the code implementing Program Tactics and the GETFOL basic inference rules.