Machine Learning Guidance for Connection TableauxDownload PDFOpen Website

2021 (modified: 03 Nov 2022)J. Autom. Reason. 2021Readers: Everyone
Abstract: Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: first, we show optimised functional implementations of connection tableaux proof search, including a consistent Skolemisation procedure for machine learning. Then, we show two guidance methods based on machine learning, namely reordering of proof steps with Naive Bayesian probabilities, and expansion of a proof search tree with Monte Carlo Tree Search.
0 Replies

Loading