Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

David Saikali

dblp:415/3982 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Generative modeling · 68% Knowledge representation and reasoning · 32%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
constraint programming
1.322026
Constrained Molecule Generation Modelled Using the Grammar Constraint · AAAI 2026
Constrained Sequential Inference in Machine Learning Using Constraint Programming · IJCAI 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
neuro-symbolic reasoning
0.912025
Constrained Sequential Inference in Machine Learning Using Constraint Programming · IJCAI 2025
Bioinformatics and computational biology
drug discovery
0.312026
Constrained Molecule Generation Modelled Using the Grammar Constraint · AAAI 2026

Methods — techniques the papers use, named apart from their topics

belief propagation · 4.7weighted counting · 3.0constraint programming · 1.7sequence models · 0.9sequence model · 0.9
YearPublicationVenuePosition
2026 Constrained Molecule Generation Modelled Using the Grammar Constraint
abstract
Drug discovery is a very time-consuming and costly endeavour due to its huge design space and to the lengthy and failure-fraught process of bringing a product to market. Automating the generation of candidate molecules exhibiting some of the desired properties can help. Among the standard formats to encode molecules, SMILES is a widespread string representation. We propose a constraint programming model showcasing the grammar constraint to express the design space of organic molecules using the SMILES notation. We show how some common physicochemical properties --- such as molecular weight and lipophilicity --- and structural features can be expressed as constraints in the model. We also contribute a weighted counting algorithm for the grammar constraint, allowing us to use a belief propagation heuristic to guide the generation. Our experiments indicate that such a heuristic is key to driving the search towards desired molecules.
David Saikali, Gilles Pesant
AAAI1
2025 Constrained Sequential Inference in Machine Learning Using Constraint Programming
abstract
Sequence models in machine learning often struggle to exhibit long-term structure. We consider this problem at inference time in the context of enforcing constraints that are not necessarily featured in the dataset on which the generative model was trained. The difficulty lies in imposing previously-unseen structure while staying close to the training dataset. It is particularly hard for long-term structure, which requires balancing foresight over many yet-to-be generated tokens and the immediacy of next-token predictions from the sequence model. We address this problem by introducing our neurosymbolic framework GeAI-BLAnC. The learned probabilities of the sequence model are mixed in with the marginal probabilities computed from a constraint programming / belief propagation framework applied to a constraint programming model expressing the desired structure. The next predicted token is then selected from the resulting probability distribution. Experiments in the context of molecule and music generation show that we can achieve the structure imposed post-training without straying too much from the structure of the dataset learned during training.
Virasone Manibod, David Saikali, Gilles Pesant
IJCAI2