Results 1 
3 of
3
Automating the Meta Theory of Deductive Systems
, 2000
"... not be interpreted as representing the o cial policies, either expressed or implied, of NSF or the U.S. Government. This thesis describes the design of a metalogical framework that supports the representation and veri cation of deductive systems, its implementation as an automated theorem prover, a ..."
Abstract

Cited by 80 (16 self)
 Add to MetaCart
not be interpreted as representing the o cial policies, either expressed or implied, of NSF or the U.S. Government. This thesis describes the design of a metalogical framework that supports the representation and veri cation of deductive systems, its implementation as an automated theorem prover, and experimental results related to the areas of programming languages, type theory, and logics. Design: The metalogical framework extends the logical framework LF [HHP93] by a metalogic M + 2. This design is novel and unique since it allows higherorder encodings of deductive systems and induction principles to coexist. On the one hand, higherorder representation techniques lead to concise and direct encodings of programming languages and logic calculi. Inductive de nitions on the other hand allow the formalization of properties about deductive systems, such as the proof that an operational semantics preserves types or the proof that a logic is is a proof calculus whose proof terms are recursive functions that may be consistent.M +
A Framework for Generic and Reusable Tactics
, 1999
"... In this paper we present a framework for the definition of generic and thus reusable tactics. We present an extension of the window inference technique which is the formal basis of a hierarchical, problemreduction style of reasoning. The window inference technique is analyzed and general reasoni ..."
Abstract
 Add to MetaCart
In this paper we present a framework for the definition of generic and thus reusable tactics. We present an extension of the window inference technique which is the formal basis of a hierarchical, problemreduction style of reasoning. The window inference technique is analyzed and general reasoning rules are separated from logic specific rules. The separation between logic specific and general rules is used to define a framework offering generic window reasoning rules to allow for the definition of generic tactics, where logic specific parts are separated from the tactic level.
Island Planning and Refinement
, 1996
"... Proof planning is an alternative to classical theorem proving. Proof planning is classical planning with no goal interaction. It faces search problems because of long solutions and possibly infinite branching. It is also required to provide plans comprehensible for the user. This article introduces ..."
Abstract
 Add to MetaCart
Proof planning is an alternative to classical theorem proving. Proof planning is classical planning with no goal interaction. It faces search problems because of long solutions and possibly infinite branching. It is also required to provide plans comprehensible for the user. This article introduces new planning strategies inspired by proof planning examples in order to tackle the searchspaceproblem and the structuredplanproblem. Island planning and refinement as well as subproblem refinement are integrated into a general planning framework and some exemplary control knowledge suitable for proof planning is given. We think that planning for other realistic problems even in a static and deterministic environment with complete information faces similar problems and can make use of our approach. 1 Introduction Refinement planning as unguided search is notoriously hard because of the combinatorial search involved. For realistic planning problems the intractable search space prevents ma...