Good heuristics are essential for successful proof search in first-order automated theorem
proving. As a result, state-of-the-art theorem provers offer a range of options for tuning the …

Premise selection is crucial for large theory reasoning with automated theorem provers as
the sheer size of the problems quickly leads to resource exhaustion. This paper proposes a …

We present a prototype of a neurally-guided automatic theorem prover for first-order logic
with equality. The prototype uses a neural network trained on previous proof search attempts …

Automated reasoning is a key research area of Artificial Intelligence (AI) and has attracted
much greater attention in recent years due to the demands of trustworthy AI, where binary …

Modern saturation theorem provers are based on the given-clause algorithm, which
iteratively selects new clauses to process. This clause selection has a large impact on the …

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic,
classical logic Automated Theorem Proving (ATP) systems. CASC-27 was the twenty-fourth …

Abstract Systems that can automate some aspects of logical reasoning are now very strong,
through years of theoretical and practical development. Some progress has been made to …

We introduce a reinforcement learning environment for deriving useful “lemma” facts to aid
existing automated theorem provers: agents receive reward for making deductions which …

It is a common approach when faced with a reasoning problem to translate that problem into
first-order logic and utilise a first-order automated theorem prover (ATP). One of the reasons …

Automatické dokazování vět je oborem umělé inteligence (AI), který sahá až k počátkům AI,
například v “Logic Theory machine” od Simona a Newella. Symbolická umělá inteligence je …