Publications
Accepted, under review.
Long papers
-
Antoine Amarilli,
Pierre Bourhis,
Mikaël Monet,
Pierre Senellart.
Evaluating Datalog via Tree Automata and Cycluits.
[pdf] -
Antoine Amarilli,
Mikaël Monet,
Pierre Senellart.
Connecting Width and Structure in Knowledge Compilation.
ICDT 2018. [pdf] -
Antoine Amarilli,
Mikaël Monet,
Pierre Senellart.
Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
PODS 2017. [pdf] -
Antoine Amarilli,
Pierre Bourhis,
Mikaël Monet,
Pierre Senellart.
Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
ICDT 2017. [full version]
Short papers
-
Mikaël Monet,
Dan Olteanu.
Towards Deterministic Decomposable Circuits for Safe Queries.
AMW 2018. [pdf]. [code only]. [code + functions] -
Antoine Amarilli,
Silviu Maniu,
Mikaël Monet.
Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
SUM 2016. [pdf] -
Mikaël Monet.
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances.
SIGMOD/PODS 2016 PhD Symposium. [pdf]