no code implementations • 7 Jun 2023 • Vincent Derkinderen, Pedro Zuidberg Dos Martires, Samuel Kolb, Paolo Morettin
Propositional model counting (#SAT) can be solved efficiently when the input formula is in deterministic decomposable negation normal form (d-DNNF).
no code implementations • 8 Feb 2022 • Mohit Kumar, Samuel Kolb, Stefano Teso, Luc De Raedt
Combinatorial optimisation problems are ubiquitous in artificial intelligence.
no code implementations • 15 Jul 2021 • Mohit Kumar, Samuel Kolb, Luc De Raedt, Stefano Teso
In this paper, we study the problem of acquiring MILPs from contextual examples, a novel and realistic setting in which examples capture solutions and non-solutions within a specific context.
no code implementations • 23 Apr 2020 • Clément Gautrais, Yann Dauxais, Stefano Teso, Samuel Kolb, Gust Verbruggen, Luc De Raedt
Everybody wants to analyse their data, but only few posses the data science expertise to to this.
no code implementations • 13 Jan 2020 • Pedro Zuidberg Dos Martires, Samuel Kolb
For both of these problems inference techniques have been developed separately in order to manage their #P-hardness, such as knowledge compilation for WMC and Monte Carlo (MC) methods for (approximate) integration in the continuous domain.