Results 1 
2 of
2
Program Tactics and Logic Tactics
 IN PROCEEDINGS 5TH INTNL. CONFERENCE ON LOGIC PROGRAMMING AND AUTOMATED REASONING (LPAR'94
, 1994
"... 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 theor ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
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 and repeat. 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.
Building and Executing Proof Strategies in a Formal Metatheory
 Advances in Artifical Intelligence: Proceedings of the Third Congress of the Italian Association for Artificial Intelligence, IA*AI'93, Volume 728 of Lecture Notes in Computer Science
, 1993
"... This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies. ..."
Abstract
 Add to MetaCart
This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies. The semantic attachment facility and the evaluation mechanism of the GETFOL system have been used to provide the procedural interpretation of logic tactics. The execution of logic tactics is then proved to be "safe" under the termination condition. The implementation within the GETFOL system is described and the synthesis of a logic tactic implementing a normalizer in negative normal form is presented as a case study. 1 Introduction As pointed out in [GMMW77], interactive theorem proving [GMW79, CAB + 86, Pau89] has been growing up in the continuum existing between proof checking [deB70, Wey80] on one side and automated theorem proving [Rob65, And81, Bib81] on the other. Interactive theorem...