MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers

08/09/2013
by   Daniel Kühlwein, et al.
0

MaLeS is an automatic tuning framework for automated theorem provers. It provides solutions for both the strategy finding as well as the strategy scheduling problem. This paper describes the tool and the methods used in it, and evaluates its performance on three automated theorem provers: E, LEO-II and Satallax. An evaluation on a subset of the TPTP library problems shows that on average a MaLeS-tuned prover solves 8.67 its default settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2021

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

Pecan is an automated theorem prover for reasoning about properties of S...
research
02/11/2014

Machine Learner for Automated Reasoning 0.4 and 0.5

Machine Learner for Automated Reasoning (MaLARea) is a learning and reas...
research
03/10/2023

Lemmas: Generation, Selection, Application

Noting that lemmas are a key feature of mathematics, we engage in an inv...
research
05/22/2022

Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers

In theorem proving, the task of selecting useful premises from a large l...
research
09/25/2022

Feature Encodings for Gradient Boosting with Automunge

Selecting a default feature encoding strategy for gradient boosted learn...
research
09/17/2013

A fully automatic problem solver with human-style output

This paper describes a program that solves elementary mathematical probl...
research
03/15/2013

Update report: LEO-II version 1.5

Recent improvements of the LEO-II theorem prover are presented. These im...

Please sign up or login with your details

Forgot password? Click here to reset