Abstract. 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 exhaustive use of such internal guidance can incur a significant slowdown of the raw inferencing process, FEMaLeCoP trained on related proofs can prove many problems that cannot be solved by leanCoP. In particular on the MPTP2078 benchmark, FEMaLeCoP adds 90 (15.7%) more problems to the 574 problems that are provable by leanCoP. FEMaLeCoP is thus the first AI/ATP system convincingly demonstrating that guiding the inter-nal inference algorithms of theorem provers by knowledge learned from previous proofs can significantly improve the performance of the p...
This paper provides an implementation, in Common Lisp, of an "epoch learning algorithm," a simple mo...
Abstract: We present ML4PG – a machine learning extension for Proof General. It allows users to gath...
Automated theorem provers can be modified in order to use external sources of axioms. This was recen...
FEMaLeCoP is a connection tableau theorem prover based on leanCoP which uses efficient implementatio...
Abstract. Many tableaux provers that follow Stickel’s Prolog Technol-ogy and lean have been relying ...
Theorem proving formalizes the notion of deductive reasoning, while machine learning formalizes the ...
We present a reinforcement learning toolkit for experiments with guiding automated theorem proving i...
Equality is a fundamental concept in first-order reasoning, yet for connection based proof methods a...
Automated Theorem Provers (ATPs) and SAT/SMT solvers are... fast and efficient;... applied in differ...
Connect++ is an automated theorem prover for first-order logic with equality, based on the clausal c...
We present ML4PG - a machine learning extension for Proof General. It allows users to gather proof s...
We present ML4PG - a machine learning extension for Proof General. It allows users to gather proof s...
When Prolog programs that manipulate lists to manage a collection of resources are rewritten to tak...
This thesis introduces the concept of a connection strength (CS) between two nodes of a propositiona...
This chapter argues for a novel method to machine learn patterns in formal proofs using statistical ...
This paper provides an implementation, in Common Lisp, of an "epoch learning algorithm," a simple mo...
Abstract: We present ML4PG – a machine learning extension for Proof General. It allows users to gath...
Automated theorem provers can be modified in order to use external sources of axioms. This was recen...
FEMaLeCoP is a connection tableau theorem prover based on leanCoP which uses efficient implementatio...
Abstract. Many tableaux provers that follow Stickel’s Prolog Technol-ogy and lean have been relying ...
Theorem proving formalizes the notion of deductive reasoning, while machine learning formalizes the ...
We present a reinforcement learning toolkit for experiments with guiding automated theorem proving i...
Equality is a fundamental concept in first-order reasoning, yet for connection based proof methods a...
Automated Theorem Provers (ATPs) and SAT/SMT solvers are... fast and efficient;... applied in differ...
Connect++ is an automated theorem prover for first-order logic with equality, based on the clausal c...
We present ML4PG - a machine learning extension for Proof General. It allows users to gather proof s...
We present ML4PG - a machine learning extension for Proof General. It allows users to gather proof s...
When Prolog programs that manipulate lists to manage a collection of resources are rewritten to tak...
This thesis introduces the concept of a connection strength (CS) between two nodes of a propositiona...
This chapter argues for a novel method to machine learn patterns in formal proofs using statistical ...
This paper provides an implementation, in Common Lisp, of an "epoch learning algorithm," a simple mo...
Abstract: We present ML4PG – a machine learning extension for Proof General. It allows users to gath...
Automated theorem provers can be modified in order to use external sources of axioms. This was recen...