paper-with-me

홈 › Papers

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

2017-06-20 · Taro Sekiyama, Akifumi Imanishi, Kohei Suenaga

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 $\lambda$-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.

📄 PDF Abstract BibTeX arXiv:1706.06462

Code (0)

등록된 구현이 없습니다.

Tasks

Machine TranslationNegationTranslation

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음
Tanh Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…
Seq2Seq Seq2Seq, or Sequence To Sequence, is a model used in sequence prediction tasks, such as language modelling and machine translation. The idea is to use one…

Similar Papers 제목 키워드 기반

Dialogues for proof search

2014-05-08 · Jesse Alama

Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effect…

Learning to Reason

2018-10-12 · Brian Groenke

Automated theorem proving has long been a key task of artificial intelligence. Proofs form the bedrock of rigorous scientific inquiry. Many tools for both partially and fully automating their derivations have been develo…

Automated Theorem ProvingQ-Learning

Deriving Theorems in Implicational Linear Logic, Declaratively

2020-09-22 · Paul Tarau, Valeria de Paiva

The problem we want to solve is how to generate all theorems of a given size in the implicational fragment of propositional intuitionistic linear logic. We start by filtering for linearity the proof terms associated by o…

Automated Theorem Proving

Deep Network Guided Proof Search

2017-01-24 · Sarah Loos, Geoffrey Irving, Christian Szegedy, Cezary Kaliszyk

Deep learning techniques lie at the heart of several significant AI advances in recent years including object recognition and detection, image captioning, machine translation, speech recognition and synthesis, and playin…

Deep LearningGame of GoImage CaptioningMachine Translation+4

Homomorphic Encryption of Intuitionistic Logic Proofs and Functional Programs: A Categorical Approach Inspired by Composite-Order Bilinear Groups

2025-02-26 · Ben Goertzel

We present a conceptual framework for extending homomorphic encryption beyond arithmetic or Boolean operations into the domain of intuitionistic logic proofs and, by the Curry-Howard correspondence, into the domain of ty…