Demo Data from EDBT 2026 / reviewers in the wild / expert
Ramiz Gindullin
dblp:325/1676
· DBLP profile ↗
6ranked-venue papers
4as first author
6since 2021 · last 2026
0000-0003-4947-9641ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 4 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 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 |
Planning, search and constraint satisfaction · 77% Knowledge representation and reasoning · 23% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint optimization |
1.0 | 1 | 2026 | Constraint Optimization of MicroPlate Designs · AAAI 2026 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint programming |
0.8 | 1 | 2024 | Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae · AAAI 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
problem decomposition |
0.8 | 1 | 2024 | Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
constraint satisfaction · 1.0constraint optimization · 1.0inductive logic programming · 0.8constraint programming · 0.8boolean formula learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Constraint Optimization of MicroPlate DesignsabstractStandardized microplates are used to conduct large-scale biomedical research. The design of microplate layouts plays an essential role in handling so-called plate effects, i.e., systematic variations across the geometry of a microplate. An effective layout allows us to detect and negate plate effects. The randomized placement of controls and compounds produces layouts of limited effectiveness, so specific approaches are needed. A previously developed system, PLAID, proposed a constraint satisfaction model to construct effective plate layouts. However, PLAID does not scale well with microplate dimensions. To improve on PLAID, we propose Constraint Optimization of MicroPlate Designs (COMPD), which allows for greater flexibility and higher quality of the layouts. Ramiz Gindullin, María Andreína Francisco Rodríguez |
AAAI | 1 |
| 2025 | Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints
Jovial Cheukam-Ngouonou, Ramiz Gindullin, Claude-Guy Quimper, Nicolas Beldiceanu, Rémi Douence |
CPAIOR (2) | 2 |
| 2025 | Minimising Source-Plate Swaps for Robotised Compound Dispensing in Microplates
Ramiz Gindullin, María Andreína Francisco Rodríguez, Brinton Seashore-Ludlow, Ola Spjuth |
CPAIOR (1) | 1 |
| 2024 | Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex FormulaeabstractGiven a table with a minimal set of input columns that functionally determines an output column, we introduce a method that tries to gradually decompose the corresponding minimal functional dependency (mfd) to acquire a formula expressing the output column in terms of the input columns. A first key element of the method is to create sub-problems that are easier to solve than the original formula acquisition problem, either because it learns formulae with fewer inputs parameters, or as it focuses on formulae of a particular class, such as Boolean formulae; as a result, the acquired formulae can mix different learning biases such as polynomials, conditionals or Boolean expressions. A second key feature of the method is that it can be applied recursively to find formulae that combine polynomial, conditional or Boolean sub-terms in a nested manner. The method was tested on data for eight families of combinatorial objects; new conjectures were found that were previously unattainable. The method often creates conjectures that combine several formulae into one with a limited number of automatically found Boolean terms. Ramiz Gindullin, Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Claude-Guy Quimper |
AAAI | 1 |
| 2023 | Boolean-Arithmetic Equations: Acquisition and Uses
Ramiz Gindullin, Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Claude-Guy Quimper |
CPAIOR | 1 |
| 2022 | Acquiring Maps of Interrelated Conjectures on Sharp BoundsabstractInternational audience Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, Claude-Guy Quimper |
CP | 4 |