Uniform Reliability of Self-Join-Free Conjunctive Queries

DOI10.46298/LMCS-18(4:3)2022OpenAlexW3008117821MaRDI QIDQ5060188

Antoine Amarilli, Benny Kimelfeld

Publication date: 9 January 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.07093v9

zbMATH Keywords

counting problems\#P-hardnesshierarchical conjunctive queriesquery reliabilitytuple-independent database

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Stochastic Games
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The complexity of the counting constraint satisfaction problem
• Mathematical Properties of the Banzhaf Power Index
• On the history of the kronecker product
• A dichotomy in the complexity of counting database repairs
• The dichotomy of probabilistic inference for unions of conjunctive queries
• The Shapley Value of Tuples in Query Answering.
• Title not available (Why is that?)

This page was built for publication: Uniform Reliability of Self-Join-Free Conjunctive Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060188)