A Study of Continuous Vector Representationsfor Theorem Proving

01/22/2021
by   Stanisław Purgał, et al.
0

Applying machine learning to mathematical terms and formulas requires a suitable representation of formulas that is adequate for AI methods. In this paper, we develop an encoding that allows for logical properties to be preserved and is additionally reversible. This means that the tree shape of a formula including all symbols can be reconstructed from the dense vector representation. We do that by training two decoders: one that extracts the top symbol of the tree and one that extracts embedding vectors of subtrees. The syntactic and semantic logical properties that we aim to reserve include both structural formula properties, applicability of natural deduction steps, and even more complex operations like unifiability. We propose datasets that can be used to train these syntactic and semantic properties. We evaluate the viability of the developed encoding across the proposed datasets as well as for the practical theorem proving problem of premise selection in the Mizar corpus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2019

Property Invariant Embedding for Automated Reasoning

Automated reasoning and theorem proving have recently become major chall...
research
02/14/2012

Probabilistic Theorem Proving

Many representation schemes combining first-order logic and probability ...
research
02/02/2020

An Experimental Study of Formula Embeddings for Automated Theorem Proving in First-Order Logic

Automated theorem proving in first-order logic is an active research are...
research
09/28/2017

Premise Selection for Theorem Proving by Deep Graph Embedding

We propose a deep learning-based approach to the problem of premise sele...
research
01/18/2018

Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties

This paper contributes to the theory of the modal μ-calculus by proving ...
research
01/01/2019

Algorithmically Efficient Syntactic Characterization of Possibility Domains

We call domain any arbitrary subset of a Cartesian power of the set {0,1...
research
11/07/2017

Splitting Proofs for Interpolation

We study interpolant extraction from local first-order refutations. We p...

Please sign up or login with your details

Forgot password? Click here to reset