Polarized Inverse Method
Cached
BibTeX
@MISC{Mclaughlin_polarizedinverse,
author = {Sean Mclaughlin and Frank Pfenning and Sean Mclaughlin and Frank Pfenning},
title = {Polarized Inverse Method},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a general architecture and several high-level optimizations that enable its efficient implementation. Some of these rely on logic-specific properties, such as polarization and focusing, which have been shown to hold in a wide range of non-classical logics. Others, such as rule subsumption and recursive backward subsumption apply in general. We empirically evaluate our techniques on first-order intuitionistic logic with our implementation Imogen and demonstrate a substantial improvement over all other existing intuitionistic theorem provers on problems from the ILTP problem library. 1
Keyphrases
inverse method non-classical logic efficient implementation several high-level optimization general architecture generic proof search procedure rule subsumption first-order intuitionistic logic recursive backward subsumption apply subformula property logic-specific property iltp problem library intuitionistic theorem provers wide range implementation imogen substantial improvement cut elimination
