Theta-Subsumption in a Constraint Satisfaction Perspective. - Jérôme Maloberti; Michèle Sebag (ILP, 2001)

Improving Efficiency of Frequent Query Discovery by Eliminating Non-relevant Candidates. - Jérôme Maloberti; Einoshin Suzuki (Discovery Science, 2003)

An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques. - Jérôme Maloberti; Einoshin Suzuki (ILP, 2004)

Fast Theta-Subsumption with Constraint Satisfaction Algorithms. - Jérôme Maloberti; Michèle Sebag (Mach. Learn., 2004)

Classification non-supervisée de données relationnelles. - Jérôme Maloberti; Shin Ando; Einoshin Suzuki (EGC, 2006)

Learning Horn Expressions with LOGAN-H. - Marta Arias; Roni Khardon; Jérôme Maloberti (J. Mach. Learn. Res., 2007)

BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion. - Alberto Cattaneo; Daniel Justus; Harry Mellor; Douglas Orr; Jérôme Maloberti; Zhenying Liu; Thorin Farnsworth; Andrew W. Fitzgibbon; Blazej Banaszewski; Carlo Luschi (CoRR, 2022)