Download PDFOpen PDF in browser

Going Polymorphic - TH1 Reasoning for Leo-III

13 pagesPublished: June 4, 2017

Abstract

While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed lambda-calculi and therefore do not allow such flexibility. In this paper, we present modifications to the higher-order automated theorem prover Leo-III for turning it into a reasoning system for rank-1 polymorphic HOL.
To that end, a polymorphic version of HOL and a suitable paramodulation-based calculus are sketched. The implementation is evaluated using a set of polymorphic TPTP THF problems.

In: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors). IWIL Workshop and LPAR Short Presentations, vol 1, pages 100--112

Links:
BibTeX entry
@inproceedings{LPAR-21S:Going_Polymorphic__TH1,
  author    = {Alexander Steen and Max Wisniewski and Christoph Benzm\textbackslash{}"uller},
  title     = {Going Polymorphic - TH1 Reasoning for Leo-III},
  booktitle = {IWIL Workshop and LPAR Short Presentations},
  editor    = {Thomas Eiter and David Sands and Geoff Sutcliffe and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {1},
  pages     = {100--112},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2515-1762},
  url       = {https://easychair.org/publications/paper/CNN},
  doi       = {10.29007/jgkw}}
Download PDFOpen PDF in browser