42 citations · 108 across the 11 of their papers we have counts for
11 papers
MurTree: Optimal Classification Trees via Dynamic Programming and Search
Emir Demirović, Anna Lukina, Emmanuel Hebrard +5
Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally us…
Partial Queries for Constraint Acquisition
Christian Bessiere, Clement Carbonnel, Anton Dries +8
Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the us…
Propagation via Kernelization: The Vertex Cover Constraint
Clément Carbonnel, Emmanuel Hébrard
The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the b…
Constraint programming for planning test campaigns of communications satellites
Emmanuel Hébrard, Marie-José Huguet, Daniel Veysseire +2
The payload of communications satellites must go through a series of tests to assert their ability to survive in space. Each test involves some equipment of the payload to be activ…
On Backdoors To Tractable Constraint Languages
Clement Carbonnel, Martin C. Cooper, Emmanuel Hebrard
In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the pr…
Soft Constraints of Difference and Equality
Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan +1
In many combinatorial problems one may need to model the diversity or similarity of assignments in a solution. For example, one may wish to maximise or minimise the number of disti…