Inductive logic programming at 30: a new introduction

A Cropper, S Dumančić - Journal of Artificial Intelligence Research, 2022 - jair.org
Inductive logic programming (ILP) is a form of machine learning. The goal of ILP is to induce
a hypothesis (a set of logical rules) that generalises training examples. As ILP turns 30, we …

Turning 30: New ideas in inductive logic programming

A Cropper, S Dumančić, SH Muggleton - arXiv preprint arXiv:2002.11002, 2020 - arxiv.org
Common criticisms of state-of-the-art machine learning include poor generalisation, a lack of
interpretability, and a need for large amounts of training data. We survey recent work in …

Inductive logic programming at 30

A Cropper, S Dumančić, R Evans, SH Muggleton - Machine Learning, 2022 - Springer
Inductive logic programming (ILP) is a form of logic-based machine learning. The goal is to
induce a hypothesis (a logic program) that generalises given training examples and …

Provenance-guided synthesis of datalog programs

M Raghothaman, J Mendelson, D Zhao… - Proceedings of the …, 2019 - dl.acm.org
We propose a new approach to synthesize Datalog programs from input-output
specifications. Our approach leverages query provenance to scale the counterexample …

Learning security classifiers with verified global robustness properties

Y Chen, S Wang, Y Qin, X Liao, S Jana… - Proceedings of the 2021 …, 2021 - dl.acm.org
Many recent works have proposed methods to train classifiers with local robustness
properties, which can provably eliminate classes of evasion attacks for most inputs, but not …

Synthesizing datalog programs using numerical relaxation

X Si, M Raghothaman, K Heo, M Naik - arXiv preprint arXiv:1906.00163, 2019 - arxiv.org
The problem of learning logical rules from examples arises in diverse fields, including
program synthesis, logic programming, and machine learning. Existing approaches either …

Algebro-geometric algorithms for template-based synthesis of polynomial programs

AK Goharshady, S Hitarth, F Mohammadi… - Proceedings of the …, 2023 - dl.acm.org
Template-based synthesis, also known as sketching, is a localized approach to program
synthesis in which the programmer provides not only a specification, but also a high-level" …

Structuring the synthesis of heap-manipulating programs

N Polikarpova, I Sergey - Proceedings of the ACM on Programming …, 2019 - dl.acm.org
This paper describes a deductive approach to synthesizing imperative programs with
pointers from declarative specifications expressed in Separation Logic. Our synthesis …

GALOIS: boosting deep reinforcement learning via generalizable logic synthesis

Y Cao, Z Li, T Yang, H Zhang… - Advances in …, 2022 - proceedings.neurips.cc
Despite achieving superior performance in human-level control problems, unlike humans,
deep reinforcement learning (DRL) lacks high-order intelligence (eg, logic deduction and …

Synthesizing database programs for schema refactoring

Y Wang, J Dong, R Shah, I Dillig - … of the 40th ACM SIGPLAN Conference …, 2019 - dl.acm.org
Many programs that interact with a database need to undergo schema refactoring several
times during their life cycle. Since this process typically requires making significant changes …