We introduce a theorem proving algorithm that uses practically no domain heuristics for
guiding its connection-style proof search. Instead, it runs many Monte-Carlo simulations …

Automated reasoning and theorem proving have recently become major challenges for
machine learning. In other domains, representations that are able to abstract over …

Probabilistic guidance based on learned knowledge is added to the connection tableau
calculus and implemented on top of the lean-CoP theorem prover, linking it to an external …

FEMaLeCoP is a connection tableau theorem prover based on leanCoP which uses efficient
implementation of internal learning-based guidance for extension steps. Despite the fact that …

Abstract leanCoP is a very compact theorem prover for classical first-order logic, based on
the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0 enhances …

State-of-the-art automated theorem provers explore large search spaces with carefully-
engineered routines, but most do not learn from past experience as human mathematicians …

MleanCoP is a fully automated theorem prover for first-order modal logic. The proof search is
based on a prefixed connection calculus and an additional prefix unification, which captures …

Most of the popular efficient proof search calculi work on formulae that are in clausal form, ie
in disjunctive or conjunctive normal form. Hence, most state-of-the-art fully automated …

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 …

This paper introduces the full versions of the non-clausal connection provers nanoCoP for
first-order classical logic, nanoCoP-i for first-order intuitionistic logic and nanoCoP-M for …