Abstract. Automatic theorem provers struggle to discharge proof obligations of interactive theorem provers. This is partly due to the large number of background facts that are passed to the automatic provers as axioms. Axiom selection algo-rithms predict the relevance of facts, thereby helping to reduce the search space of automatic provers. This paper presents an introduction to axiom selection as a machine learning problem and describes the challenges that distinguish it from other applications of machine learning.
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Automated theorem proving essentially amounts to solving search problems. Despite significant progre...
Abstract: Theorem provers are extremely useful tools for reasoning about complex mathematics and lar...
Contains fulltext : 132733.pdf (preprint version ) (Open Access
Computer programs to find formal proofs of theorems were originally designed as tools for mathematic...
Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of le...
In the logical theory of a set of axioms there are many bor-ing logical consequences, and scattered ...
We present an overview of various learning techniques used in automated theorem provers. We characte...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signi...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signi...
The Algorithm Selection Problem is to select the most appropriate way for solving a problem given a ...
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the ...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizati...
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Automated theorem proving essentially amounts to solving search problems. Despite significant progre...
Abstract: Theorem provers are extremely useful tools for reasoning about complex mathematics and lar...
Contains fulltext : 132733.pdf (preprint version ) (Open Access
Computer programs to find formal proofs of theorems were originally designed as tools for mathematic...
Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of le...
In the logical theory of a set of axioms there are many bor-ing logical consequences, and scattered ...
We present an overview of various learning techniques used in automated theorem provers. We characte...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signi...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite signi...
The Algorithm Selection Problem is to select the most appropriate way for solving a problem given a ...
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the ...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizati...
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for...
Efficient reasoning in large knowledge bases is an important problem for AI systems. Hand-optimizat...
Automated theorem proving essentially amounts to solving search problems. Despite significant progre...
Abstract: Theorem provers are extremely useful tools for reasoning about complex mathematics and lar...