Research

Here you can find some of the research papers I have published in the past years.

CoreTrail and ShareTrail: Incremental Core-Guided MaxSAT Solvers

MaxSAT Evaluation 2026 · 17 pages · 1st and 3rd place

We submit two incremental core-guided MaxSAT solvers to the MaxSAT Evaluation: CoreTrail and ShareTrail. Both solvers support sequences of related MaxSAT calls with added hard clauses, changing assumptions, and modified soft weights. CoreTrail is a C++ reimplementation of Python RC2 extended with incremental capabilities. ShareTrail extends CGSS2 with incremental solving and ordered-objective support. The solvers achieved 1st and 3rd place.

Hermax: A Unified MaxSAT Library

29th International Conference on Theory and Applications of Satisfiability Testing (SAT 2026), tool paper, pages 41:1–41:13

Despite the utility of Maximum Satisfiability (MaxSAT) in discrete optimization, developing iterative workflows remains cumbersome due to fragmented, low-level solver APIs. We present Hermax, a unified Python library and modelling compiler for MaxSAT. Hermax provides an IPAMIR interface that exposes incremental solving, assumptions, and weight updates through a single API across many incremental and non-incremental backends. Furthermore, it introduces a compiler with Constraint Programming primitives that translates high-level models directly into optimized CNF/WCNF through eager evaluation. This compiler allows automatic optimizations like integer ladder graph encoding that bypasses Pseudo-Boolean formulation when possible. Together, these features enable rapid prototyping and production grade optimization directly from Python across major platforms and hardware architectures.

An Intelligent Decision System for Sustainable Food Production: Mitigating Waste via CVaR Stochastic Optimisation

International Journal of Computational Intelligence Systems (2026)

We present an intelligent decision framework for sustainable manufacturing in a high throughput perishable meat factory. We address this challenge of food waste in a facility with a two-week turnover exceeding €1 million. We develop a risk aware stochastic linear program with hierarchical objectives: (i) satisfy demand, (ii) balance daily workload to limit labour volatility, and (iii) minimise environmental and economic waste using a Conditional Value-at-Risk (CVaR) term calibrated from historical data. We analyse age-agnostic retrieval and age-aware retrieval warehouses and the impact on the production schedule. On retrospective industrial data, the proposed system reduces CVaR risk.

Synthetic data through combinatorial optimization of pairwise probabilities

International Journal of Data Science and Analytics, 22(1), 154 · Published 29 April 2026

The generation of synthetic data is critical in domains where real data are limited or cannot be used directly. We propose DISCO (Discrete Intersection Synthesizer through Combinatorial Optimization), a synthetic generator for tabular data based on pairwise probabilities. DISCO models data by optimizing the intersection of pairwise probabilities on each generated row to resemble the original dataset.

Modelling and optimising switching on a physical binary sorter

Annals of Operations Research, 358(1), 447–468 · Published 3 February 2026

We apply MaxSAT to a system built around a physical binary sorter that functions as a load balancer between warehouses. We study a sorter operating in real time on 4.5 million elements per year. The optimization task is to minimize the switching needed to route a sequence of elements, under an arbitrary binary function that constrains the achievable load balance. The case study is drawn from a company operating hundreds of such sorters, which are essential to its internal logistics. We examine the problem from theoretical and practical perspectives, present an online model, analyze its properties, and evaluate several implementations across different scenarios. Experiments show switching reductions of 63% and 48% for two problem variants in a partial information setting.

Exploiting Configurations of MaxSAT Solvers

29th International Conference on Principles and Practice of Constraint Programming (CP 2023)

In this paper, we describe how we can effectively exploit alternative parameter configurations to a MaxSAT solver. We describe how these configurations can be computed in the context of MaxSAT. In particular, we experimentally show how to easily combine configurations of a non-competitive solver to obtain a better solving approach.

Incomplete MaxSAT approaches for combinatorial testing

Incomplete MaxSAT approaches for combinatorial testing: Journal of Heuristics volume 28, pages 377–431 (2022)

We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum Satisfiability (MaxSAT) technology by describing efficient encodings for different classes of complete and incomplete MaxSAT solvers to compute optimal and suboptimal solutions, respectively. Similarly, we show how to solve through MaxSAT technology a closely related problem, the Tuple Number problem, which we extend to incorporate constraints. For this problem, we additionally provide a new MaxSAT-based incomplete algorithm. The extensive experimental evaluation we carry out on the available Mixed Covering Arrays with Constraints benchmarks and the comparison with state-of-the-art tools confirm the good performance of our approaches.

OptiLog V2: Model, Solve, Tune and Run

OptiLog V2: Model, Solve, Tune and Run: International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)

We present an extension of the OptiLog Python framework. We fully redesign the solvers module to support the dynamic loading of incremental SAT solvers with support for external libraries. We introduce new modules for modelling problems into Non-CNF format with support for Pseudo Boolean constraints, for evaluating and parsing the results of applications, and we add support for constrained execution of blackbox programs and SAT-heritage integration. All these enhancements allow OptiLog to become a swiss knife for SAT-based applications in academic and industrial environments.

OptiLog: A Framework for SAT-based Systems

OptiLog: A Framework for SAT-based Systems: International Conference on Theory and Applications of Satisfiability Testing (SAT 2021)

We present OptiLog, a new Python framework for rapid prototyping of SAT-based systems. OptiLog allows to use and integrate SAT solvers currently developed in C/C++ just by implementing the iSAT C++ interface. It also provides a Python binding to the PBLib C++ toolkit for encoding Pseudo Boolean and Cardinality constraints. Finally, it leverages the power of automatic configurators by allowing to easily create configuration scenarios including multiple solvers and encoders.