Bayesian Optimisation with Gaussian Processes for Premise Selection

by   Agnieszka Słowik, et al.

Heuristics in theorem provers are often parameterised. Modern theorem provers such as Vampire utilise a wide array of heuristics to control the search space explosion, thereby requiring optimisation of a large set of parameters. An exhaustive search in this multi-dimensional parameter space is intractable in most cases, yet the performance of the provers is highly dependent on the parameter assignment. In this work, we introduce a principled probablistic framework for heuristics optimisation in theorem provers. We present results using a heuristic for premise selection and The Archive of Formal Proofs (AFP) as a case study.


page 1

page 2

page 3

page 4


Bayesian Optimisation for Premise Selection in Automated Theorem Proving (Student Abstract)

Modern theorem provers utilise a wide array of heuristics to control the...

Inconsistency and Accuracy of Heuristics with A* Search

Many studies in heuristic search suggest that the accuracy of the heuris...

Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation

Selection hyper-heuristics are randomised search methodologies which cho...

MACS: An Agent-Based Memetic Multiobjective Optimization Algorithm Applied to Space Trajectory Design

This paper presents an algorithm for multiobjective optimization that bl...

Emergence of Structural Bias in Differential Evolution

Heuristic optimisation algorithms are in high demand due to the overwhel...

Unit Selection: Case Study and Comparison with A/B Test Heuristic

The unit selection problem defined by Li and Pearl identifies individual...

Please sign up or login with your details

Forgot password? Click here to reset