136 citations · 313 across the 25 of their papers we have counts for
4 papers · 1 filter
Connecting Knowledge Compilation Classes and Width Parameters
Antoine Amarilli, Florent Capelli, Mikaël Monet +1
The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structure…
Evaluating Datalog via Tree Automata and Cycluits
Antoine Amarilli, Pierre Bourhis, Mikaël Monet +1
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-gu…
BelMan: Bayesian Bandits on the Belief--Reward Manifold
Debabrota Basu, Pierre Senellart, Stéphane Bressan
We propose a generic, Bayesian, information geometric approach to the exploration--exploitation trade-off in multi-armed bandit problems. Our approach, BelMan, uniformly supports p…
Computing Possible and Certain Answers over Order-Incomplete Data
Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch +1
This paper studies the complexity of query evaluation for databases whose relations are partially ordered; the problem commonly arises when combining or transforming ordered data f…