EDBT 2026 Demo / reviewers in the wild / expert
Lily Gallois
dblp:246/2860
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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.
| Theoretical computer science
1 paper |
Logic in computer science · 61% Automata and formal languages · 30% Computational complexity · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › petri nets
boundedness problem |
0.4 | 1 | 2019 | Oblivious and Semi-Oblivious Boundedness for Existential Rules · IJCAI 2019 |
Logic in computer science › knowledge representation and reasoning › existential rules
chase termination |
0.4 | 1 | 2019 | Oblivious and Semi-Oblivious Boundedness for Existential Rules · IJCAI 2019 |
Logic in computer science › knowledge representation and reasoning
existential rules |
0.4 | 1 | 2019 | Oblivious and Semi-Oblivious Boundedness for Existential Rules · IJCAI 2019 |
Computational complexity
decidability |
0.1 | 1 | 2019 | Oblivious and Semi-Oblivious Boundedness for Existential Rules · IJCAI 2019 |
Methods — techniques the papers use, named apart from their topics
FO-rewritability · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Oblivious and Semi-Oblivious Boundedness for Existential RulesabstractWe study the notion of boundedness in the context positive existential rules, that is, wether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it is decidable to recognize if a set of rules is bounded for several classes of rules and outline the complexity of the problem. Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana, Lily Gallois |
IJCAI | 6 |