Inductive logic programming at 30: a new introduction
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 …
a hypothesis (a set of logical rules) that generalises training examples. As ILP turns 30, we …
Turning 30: New ideas in inductive logic programming
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 …
interpretability, and a need for large amounts of training data. We survey recent work in …
Learning programs by learning from failures
We describe an inductive logic programming (ILP) approach called learning from failures. In
this approach, an ILP system (the learner) decomposes the learning problem into three …
this approach, an ILP system (the learner) decomposes the learning problem into three …
Inductive logic programming at 30
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 …
induce a hypothesis (a logic program) that generalises given training examples and …
Machine learning in access control: A taxonomy and survey
An increasing body of work has recognized the importance of exploiting machine learning
(ML) advancements to address the need for efficient automation in extracting access control …
(ML) advancements to address the need for efficient automation in extracting access control …
The ilasp system for inductive learning of answer set programs
The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of
examples in the context of some pre-existing background knowledge. Until recently, most …
examples in the context of some pre-existing background knowledge. Until recently, most …
The role of foundation models in neuro-symbolic learning and reasoning
Abstract Neuro-Symbolic AI (NeSy) holds promise to ensure the safe deployment of AI
systems, as interpretable symbolic techniques provide formal behaviour guarantees. The …
systems, as interpretable symbolic techniques provide formal behaviour guarantees. The …
From SMT to ASP: Solver-based approaches to solving datalog synthesis-as-rule-selection problems
Given a set of candidate Datalog rules, the Datalog synthesis-as-rule-selection problem
chooses a subset of these rules that satisfies a specification (such as an input-output …
chooses a subset of these rules that satisfies a specification (such as an input-output …
Gensynth: Synthesizing datalog programs without language bias
Techniques for learning logic programs from data typically rely on language bias
mechanisms to restrict the hypothesis space. These methods are therefore limited by the …
mechanisms to restrict the hypothesis space. These methods are therefore limited by the …
[PDF][PDF] Scalable Non-observational Predicate Learning in ASP.
Recently, novel ILP systems under the answer set semantics have been proposed, some of
which are robust to noise and scalable over large hypothesis spaces. One such system is …
which are robust to noise and scalable over large hypothesis spaces. One such system is …