Download PDFOpen PDF in browser

Leo-III Version 1.1 (System description)

16 pagesPublished: June 4, 2017

Abstract

Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives. It is based on a paramodulation calculus with ordering constraints and, in tradition of its predecessor LEO-II, heavily relies on cooperation with external first-order theorem provers.
Unlike LEO-II, asynchronous cooperation with typed first-order provers and an agent-based internal cooperation scheme is supported. In this paper, we sketch Leo-III's underlying calculus, survey implementation details and give examples of use.

Keyphrases: automated theorem prover, higher-order logic, paramodulation, system description

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

Links:
BibTeX entry
@inproceedings{LPAR-21S:Leo_III_Version_1.1_System,
  author    = {Christoph Benzm\textbackslash{}"uller and Alexander Steen and Max Wisniewski},
  title     = {Leo-III Version 1.1 (System description)},
  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     = {11--26},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {https://easychair.org/publications/paper/sl},
  doi       = {10.29007/grmx}}

The requested page was not found on this server.

Download PDFOpen PDF in browser