Daniel Le Berre — accepted AI-conference papers

2025

A SAT-based Method for Counting All Singleton Attractors in Boolean Networks

Rei Higuchi, Takehide Soh, Daniel Le Berre, Morgan Magnin, Mutsunori Banbara, Naoyuki Tamura

IJCAI 2025

Boolean networks (BNs) are widely used to model biological regulatory networks. Attractors here hold significant meaning as they represent long-term behaviors such as homeostasis and the results of cell differentiation. As such, computing attractors is of critical importance to guarantee the validit

Cited by 0 Source ↗PDF ↗code ↗Scholar ↗

2020

On Irrelevant Literals in Pseudo-Boolean Constraint Learning

Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon

IJCAI 2020poster

Learning pseudo-Boolean (PB) constraints in PB solvers exploiting cutting planes based inference is not as well understood as clause learning in conflict-driven clause learning solvers. In this paper, we show that PB constraints derived using cutting planes may contain irrelevant literals, i.e., li…

Cited by 0 Source ↗PDF ↗Scholar ↗