Towards Proof Synthesis Guided by Neural Machine Translation for Intuitionistic Propositional Logic

06/20/2017
by   Taro Sekiyama, et al.
0

Inspired by the recent evolution of deep neural networks (DNNs) in machine learning, we explore their application to PL-related topics. This paper is the first step towards this goal; we propose a proof-synthesis method for the negation-free propositional logic in which we use a DNN to obtain a guide of proof search. The idea is to view the proof-synthesis problem as a translation from a proposition to its proof. We train seq2seq, which is a popular network in neural machine translation, so that it generates a proof encoded as a λ-term of a given proposition. We implement the whole framework and empirically observe that a generated proof term is close to a correct proof in terms of the tree edit distance of AST. This observation justifies using the output from a trained seq2seq model as a guide for proof search.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2018

Automated proof synthesis for propositional logic with deep neural networks

This work explores the application of deep learning, a machine learning ...
research
07/31/2020

Proof search for full intuitionistic propositional logic through a coinductive approach for polarized logic

The approach to proof search dubbed "coinductive proof search", and prev...
research
10/25/2019

Deep Reinforcement Learning in HOL4

The paper describes an implementation of deep reinforcement learning thr...
research
04/18/2018

Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic

The inverse method is a saturation based theorem proving technique; it r...
research
06/25/2020

Modeling Baroque Two-Part Counterpoint with Neural Machine Translation

We propose a system for contrapuntal music generation based on a Neural ...
research
09/03/2020

Tree Neural Networks in HOL4

We present an implementation of tree neural networks within the proof as...
research
01/17/2021

A bi-directional extensible interface between Lean and Mathematica

We implement a user-extensible ad hoc connection between the Lean proof ...

Please sign up or login with your details

Forgot password? Click here to reset