111 citations
- Institute for Infocomm ResearchSG23 papers
- Centre National de la Recherche ScientifiqueFR20 papers
- National University of SingaporeSG19 papers
- Université Toulouse III - Paul SabatierFR10 papers
- Agency for Science, Technology and ResearchSG9 papers
- Institut Polytechnique de BordeauxFR8 papers
- Institut de Recherche en Informatique de ToulouseFR7 papers
- Université Toulouse-I-CapitoleFR7 papers
- Université Toulouse - Jean JaurèsFR7 papers
- Bioinformatics InstituteSG6 papers
- Equipes Traitement de l'Information et SystèmesFR6 papers
- Nanyang Technological UniversitySG6 papers
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2024★ 2 cited
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
Pratik Karmakar, Mikaël Monet, Pierre Senellart +1
Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, a…
cs.DB2016★ 11 cited
Tractable Lineages on Treelike Instances: Limits and Extensions
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them…
cs.DB2015★ 44 cited
Provenance Circuits for Trees and Treelike Instances (Extended Version)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been…