Differentiable Inductive Logic Programming for Structured Examples
- URL: http://arxiv.org/abs/2103.01719v1
- Date: Tue, 2 Mar 2021 13:47:33 GMT
- Title: Differentiable Inductive Logic Programming for Structured Examples
- Authors: Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto
- Abstract summary: We propose a new framework to learn logic programs from noisy and structured examples.
We show that our new framework can learn logic programs from noisy and structured examples, such as sequences or trees.
Our framework can be scaled to deal with complex programs that consist of several clauses with function symbols.
- Score: 6.8774606688738995
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The differentiable implementation of logic yields a seamless combination of
symbolic reasoning and deep neural networks. Recent research, which has
developed a differentiable framework to learn logic programs from examples, can
even acquire reasonable solutions from noisy datasets. However, this framework
severely limits expressions for solutions, e.g., no function symbols are
allowed, and the shapes of clauses are fixed. As a result, the framework cannot
deal with structured examples. Therefore we propose a new framework to learn
logic programs from noisy and structured examples, including the following
contributions. First, we propose an adaptive clause search method by looking
through structured space, which is defined by the generality of the clauses, to
yield an efficient search space for differentiable solvers. Second, we propose
for ground atoms an enumeration algorithm, which determines a necessary and
sufficient set of ground atoms to perform differentiable inference functions.
Finally, we propose a new method to compose logic programs softly, enabling the
system to deal with complex programs consisting of several clauses. Our
experiments show that our new framework can learn logic programs from noisy and
structured examples, such as sequences or trees. Our framework can be scaled to
deal with complex programs that consist of several clauses with function
symbols.
Related papers
- An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
This approach allows for the computer-assisted analysis of abstract dialectical frameworks.
Exemplary applications include the formal analysis and verification of meta-theoretical properties.
arXiv Detail & Related papers (2023-12-08T09:32:26Z) - When Do Program-of-Thoughts Work for Reasoning? [51.2699797837818]
We propose complexity-impacted reasoning score (CIRS) to measure correlation between code and reasoning abilities.
Specifically, we use the abstract syntax tree to encode the structural information and calculate logical complexity.
Code will be integrated into the EasyInstruct framework at https://github.com/zjunlp/EasyInstruct.
arXiv Detail & Related papers (2023-08-29T17:22:39Z) - Modeling Hierarchical Reasoning Chains by Linking Discourse Units and
Key Phrases for Reading Comprehension [80.99865844249106]
We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning.
Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
arXiv Detail & Related papers (2023-06-21T07:34:27Z) - Query Structure Modeling for Inductive Logical Reasoning Over Knowledge
Graphs [67.043747188954]
We propose a structure-modeled textual encoding framework for inductive logical reasoning over KGs.
It encodes linearized query structures and entities using pre-trained language models to find answers.
We conduct experiments on two inductive logical reasoning datasets and three transductive datasets.
arXiv Detail & Related papers (2023-05-23T01:25:29Z) - A separation logic for sequences in pointer programs and its
decidability [5.229882716833972]
We propose sequence-heap separation logic which integrates sequences into logical reasoning on heap-manipulated programs.
Quantifiers over sequence variables and singleton heap storing sequence are new members in our logic.
The propositional fragment of sequence-heap separation logic is decidable, and the fragment with 2 alternations on program variables and 1 alternation on sequence variables is undecidable.
arXiv Detail & Related papers (2023-01-16T02:52:06Z) - A Divide-Align-Conquer Strategy for Program Synthesis [8.595181704811889]
We show that compositional segmentation can be applied in the programming by examples setting to divide the search for large programs across multiple smaller program synthesis problems.
A structural alignment of the constituent parts in the input and output leads to pairwise correspondences used to guide the program search.
arXiv Detail & Related papers (2023-01-08T19:10:55Z) - Representing Partial Programs with Blended Abstract Semantics [62.20775388513027]
We introduce a technique for representing partially written programs in a program synthesis engine.
We learn an approximate execution model implemented as a modular neural network.
We show that these hybrid neuro-symbolic representations enable execution-guided synthesizers to use more powerful language constructs.
arXiv Detail & Related papers (2020-12-23T20:40:18Z) - Sequential composition of propositional logic programs [0.0]
We show that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for arbitrary programs.
We show that the immediate consequence operator of a program can be represented via composition which allows us to compute its least model without any explicit reference to operators.
arXiv Detail & Related papers (2020-09-12T11:57:30Z) - Generating Random Logic Programs Using Constraint Programming [12.47276164048813]
We present a novel approach to generating random logic programs using constraint programming.
We show how the model scales with parameter values, and use the model to compare probabilistic inference algorithms across a range of synthetic problems.
arXiv Detail & Related papers (2020-06-02T19:12:53Z) - LogicalFactChecker: Leveraging Logical Operations for Fact Checking with
Graph Module Network [111.24773949467567]
We propose LogicalFactChecker, a neural network approach capable of leveraging logical operations for fact checking.
It achieves the state-of-the-art performance on TABFACT, a large-scale, benchmark dataset.
arXiv Detail & Related papers (2020-04-28T17:04:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.