Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations-Reference-Cited by-同舟云学术

Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations

Published:2022-06-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Focke Jacob¹,Goldberg Leslie Ann²,Roth Marc²,Zivný Stanislav²

Affiliation:

1. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

2. University of Oxford, Oxford, United Kingdom

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3517804.3526231

Reference43 articles.

1. Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . http://webdam.inria.fr/Alice/ Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http://webdam.inria.fr/Alice/

2. Biomolecular network motif counting and discovery by color coding

3. Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries

4. When is approximate counting for conjunctive queries tractable?

5. Vikraman Arvind and Venkatesh Raman . 2002 . Approximation Algorithms for Some Parameterized Counting Problems. In Algorithms and Computation , 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21--23, 2002, Proceedings (Lecture Notes in Computer Science , Vol. 2518), Prosenjit Bose and Pat Morin (Eds.). Springer, 453-- 464 . https://doi.org/10.1007/3--540--36136--7_40 Vikraman Arvind and Venkatesh Raman. 2002. Approximation Algorithms for Some Parameterized Counting Problems. In Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21--23, 2002, Proceedings (Lecture Notes in Computer Science, Vol. 2518), Prosenjit Bose and Pat Morin (Eds.). Springer, 453--464. https://doi.org/10.1007/3--540--36136--7_40

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Answer Counting under Guarded TGDs;Logical Methods in Computer Science;2023-09-14

2. The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02