Abstract Inductive logic programming (ILP) is a form of logic-based machine learning. The goal to induce hypothesis (a program) that generalises given training examples and background knowledge. As ILP turns 30, we review the last decade research. We focus on (i) new meta-level search methods, (ii) techniques for learning recursive programs, (iii) approaches predicate invention, (iv) use differ...

Since its introduction in the late 1950s, isolated limb perfusion (ILP) has been the preferred treatment option for locally advanced melanoma and sarcoma confined to a limb. This treatment results in high response rates with a satisfying duration of response in both tumor types. A drawback of ILP, however, is the invasive and complex character of the procedure. Isolated limb infusion (ILI) has ...

This chapter aims at demonstrating that inductive logic programming (ILP), a recently established subfield of machine learning that induces first-order clausal theories from examples, combines very well with the area of deductive databases. In the context of deductive databases, induction can be defined as inference of intensional knowledge from extensional knowledge. Classification-oriented IL...

Inductive Logic Programming (ILP) is often situated as a research area emerging at the intersection of Machine Learning and Logic Programming (LP) This paper makes the link more clear between ILP and LP, in particular, between ILP and Abductive Logic Programming (ALP), 1 e , LP extended with abductive reasoning We formulate a generic framework for handling incomplete knowledge This framework ca...

We present a novel two-stage technique for detecting speech disfluencies based on Integer Linear Programming (ILP). In the first stage we use state-of-the-art models for speech disfluency detection, in particular, hidden-event language models, maximum entropy models and conditional random fields. During testing each model proposes possible disfluency labels which are then assessed in the presen...

We propose an integer linear programming (ILP) formulation for the minimum relay break point set (BPS) computation. Subsequently, in the ILP framework, we propose an alternate maximum-independent relay BPS formulation with the intention of minimizing dependency within the BPS. We show that 1) in practice, the relaxed version of the ILP suffices to obtain an integral vertex and 2) the relaxed ve...