Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
The aim of the MATHsAiD project is to build a tool for automated theorem-discovery; to design and bu...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
Lemmas can provide valuable help for constructing a proof, by providing intermediate steps. However,...
AbstractLarge formal mathematical libraries consist of millions of atomic inference steps that give ...
Interactive proofs of theorems often require auxiliary helper lemmas to prove the desired theorem. E...
Large formal mathematical libraries consist of millions of atomic inference steps that give rise to ...
Automating proofs by induction can be challenging, not least because proofs might need auxiliary lem...
In this thesis we deal with the problem of automatic proving (or disproving) mathematical conjecture...
We present an overview of various learning techniques used in automated theorem provers. We characte...
Computer programs to find formal proofs of theorems were originally designed as tools for mathematic...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
Abstract. Automatic theorem provers struggle to discharge proof obligations of interactive theorem p...
AbstractThe improvement of theorem provers by reusing previously computed proofs is investigated. A ...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
The aim of the MATHsAiD project is to build a tool for automated theorem-discovery; to design and bu...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
Lemmas can provide valuable help for constructing a proof, by providing intermediate steps. However,...
AbstractLarge formal mathematical libraries consist of millions of atomic inference steps that give ...
Interactive proofs of theorems often require auxiliary helper lemmas to prove the desired theorem. E...
Large formal mathematical libraries consist of millions of atomic inference steps that give rise to ...
Automating proofs by induction can be challenging, not least because proofs might need auxiliary lem...
In this thesis we deal with the problem of automatic proving (or disproving) mathematical conjecture...
We present an overview of various learning techniques used in automated theorem provers. We characte...
Computer programs to find formal proofs of theorems were originally designed as tools for mathematic...
Theory exploration is a technique for automatically discovering new interesting lemmas in a mathemat...
Abstract. Automatic theorem provers struggle to discharge proof obligations of interactive theorem p...
AbstractThe improvement of theorem provers by reusing previously computed proofs is investigated. A ...
AbstractThis paper describes the study of some specific test problems in automated theorem proving. ...
The discovery of unknown lemmas, case-splits and other so called eureka steps are challenging proble...
The aim of the MATHsAiD project is to build a tool for automated theorem-discovery; to design and bu...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...