paper-with-me

Papers

Learning MDL logic programs from noisy data

2023-08-18 · Céline Hocquette, Andreas Niskanen, Matti Järvisalo, Andrew Cropper

Many inductive logic programming approaches struggle to learn programs from noisy data. To overcome this limitation, we introduce an approach that learns minimal description length programs from noisy data, including recursive programs. Our experiments on several domains, including drug design, game playing, and program synthesis, show that our approach can outperform existing approaches in terms of predictive accuracies and scale to moderate amounts of noise.

📄 PDF Abstract BibTeX arXiv:2308.09393

Code (1)

celinehocquette/aaai24-maxsynth 공식 구현

Tasks

Drug DesignInductive logic programmingProgram Synthesis

Similar Papers 제목 키워드 기반

Differentiable Inductive Logic Programming for Structured Examples

2021-03-02 · Hikaru Shindo, Masaaki Nishino, Akihiro Yamamoto

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 exampl…

Inductive logic programming

Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation

2024-08-21 · Fieke Hillerstrom, Gertjan Burghouts

Many inductive logic programming (ILP) methods are incapable of learning programs from probabilistic background knowledge, e.g. coming from sensory data or neural networks with probabilities. We propose Propper, which ha…

Graph Neural NetworkInductive logic programming

Learning Logical Rules using Minimum Message Length

2025-08-08 · Ruben Sharma, Sebastijan Dumančić, Ross D. King, Andrew Cropper arxiv

Unifying probabilistic and logical learning is a key challenge in AI. We introduce a Bayesian inductive logic programming approach that learns minimum message length hypotheses from noisy data. Our approach balances hypo…

Inductive logic programming

On the Verification of Belief Programs

2022-04-26 · Daxin Liu, Gerhard Lakemeyer

In a recent paper, Belle and Levesque proposed a framework for a type of program called belief programs, a probabilistic extension of GOLOG programs where every action and sensing result could be noisy and every test con…

Inductive Program Synthesis over Noisy Datasets using Abstraction Refinement Based Optimization

2021-04-27 · Shivam Handa, Martin Rinard

We present a new synthesis algorithm to solve program synthesis over noisy datasets, i.e., data that may contain incorrect/corrupted input-output examples. Our algorithm uses an abstraction refinement based optimization …

Program Synthesis