Romain Wallon

Romain Wallon
Université d'Artois · CRIL Centre de Recherche en Informatique de Lens

Doctor of Philosophy
Associate Professor at Univ. Artois

About

18
Publications
184
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
14
Citations
Introduction
Romain Wallon is an associate professor at Artois University (Lens, France), and does his research at CRIL (Lens Computer Science Research Lab). He is interested in satisfiability solving, and in particular in approaches based on pseudo-Boolean reasoning. He also works on different applications of SAT solvers, such as constrained optimization and knowledge compilation.
Additional affiliations
October 2021 - present
Université d'Artois
Position
  • Professor (Associate)
October 2020 - September 2021
École Polytechnique
Position
  • PostDoc Position
October 2017 - September 2020
Université d'Artois
Position
  • PhD Student
Education
October 2017 - December 2020
Université d'Artois
Field of study
  • Computer Science
September 2015 - September 2017
Université d'Artois
Field of study
  • Computer Science
September 2012 - September 2015
Université d'Artois
Field of study
  • Computer Science

Publications

Publications (18)
Presentation
When developing a SAT solver, one of the most important parts is to perform experiments so as to evaluate its performance. Most of the time, this process remains the same, so that everybody collects almost the same statistics about the solver execution. However, how many scripts are there to retrieve experimental data and draw scatter or cactus plo...
Conference Paper
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers. In particular, such PB solvers not only implement a (cutting-planes-based) conflict analysis procedure, but also complementary strategies for components that are crucial for t...
Conference Paper
Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generalized resolution, which allows to infer strong constraints, but suffers from the growth of coefficients it generates while combining pseudo-Boolean constraints. Another vari...
Conference Paper
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., literals whose assigned values (whatever they are) ne...
Preprint
Current PB solvers implement many techniques inspired by the CDCL architecture of modern SAT solvers, so as to benefit from its practical efficiency. However, they also need to deal with the fact that many of the properties leveraged by this architecture are no longer true when considering PB constraints. In this paper, we focus on one of these pro...
Preprint
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers. In particular, such PB solvers not only implement a (cutting-planes-based) conflict analysis procedure, but also complementary strategies for components that are crucial for t...
Conference Paper
Les solveurs pseudo-booléens (PB) travaillant nativement sur des contraintes PB sont fondés sur l’architecture CDCL à l’origine des hautes performances des solveurs SAT modernes. En particulier, ces solveurs PB utilisent non seulement une procédure d’analyse de conflits (utilisant les plans-coupes), mais également des stratégies complémentaires qui...
Conference Paper
Le développement de solveurs de contraintes s’accompagne nécessairement d’une phase d’expérimentation, permettant d’évaluer les performances des fonctionnalités implantées. Pour chacun des solveurs considérés, il faut alors collecter et analyser des statistiques relatives à leur exécution et qui, le plus souvent, restent les mêmes. Néanmoins, il ex...
Preprint
Current pseudo-Boolean solvers implement different variants of the cutting planes proof system to infer new constraints during conflict analysis. One of these variants is generalized resolution, which allows to infer strong constraints, but suffers from the growth of coefficients it generates while combining pseudo-Boolean constraints. Another vari...
Presentation
Current implementations of pseudo-Boolean (PB) solvers are based on the CDCL architecture , which is the central component of modern SAT solvers. In addition to clause learning, this architecture comes with many strategies that help the solver find its way through the search space, either to a solution or to an unsatisfiability proof. Particularly...
Article
We consider bounded width CNF-formulas where the width is measured by popular graph width measures on graphs associated to CNF-formulas. Such restricted graph classes, in particular those of bounded treewidth, have been extensively studied for their uses in the design of algorithms for various computational problems on CNF-formulas. Here we conside...
Preprint
We consider bounded width CNF-formulas where the width is measured by popular graph width measures on graphs associated to CNF-formulas. Such restricted graph classes, in particular those of bounded treewidth, have been extensively studied for their uses in the design of algorithms for various computational problems on CNF-formulas. Here we conside...
Conference Paper
We consider bounded width CNF-formulas where the width is measured by popular graph width measures on graphs associated to CNF-formulas. Such restricted graph classes, in particular those of bounded treewidth, have been extensively studied for their uses in the design of algorithms for various computational problems on CNF-formulas. Here we conside...
Presentation
Learning pseudo-Boolean (PB) constraints in PB solvers using the cutting planes proof system is a problem that is not as well understood as clause learning in conflict driven clause learning solvers. In particular, it turns out that approaches based on generalized resolution may derive PB constraints containing irrelevant literals, i.e. literals wh...
Conference Paper
L'apprentissage de contraintes pseudo-booléennes (PB) dans les solveurs PB via le système de preuve des plans-coupes n'est pas aussi bien compris que celui des clauses dans les solveurs SAT utilisant l'analyse de conflit. En particulier, les approches basées sur la résolution généralisée peuvent déduire des contraintes PB comportant des littéraux n...
Conference Paper
We study pseudo-Boolean constraints (PBC) and their special case cardinality constraints (CARD) from the perspective of knowledge representation. To this end, the succinctness of PBC and CARD is compared to that of many standard propositional languages. Moreover, we determine which queries and transformations are feasible in polynomial time when kn...
Preprint
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., literals whose assigned values (whatever they are) ne...

Network