Certain Answers Meet Zero-One Laws
Summary: Refines certain answers via limiting probabilities over interpretations of missing data. Proves a 0–1 law—almost-certain answers are exactly naive answers—while constraints yield computable rational probabilities and tractable characterizations of answer comparisons. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Leonid Libkin (University of Edinburgh)
BibTeX Citation
@inproceedings{libkin_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Certain Answers Meet Zero-One Laws}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196983},
doi = {10.1145/3196959.3196983},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Libkin, Leonid},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,170 | Probabilistic Databases with an Infinite Open-World Assumption | 2019 | PODS | 5.9514805e-05 |
| 6,741 | Probabilistic Databases for All | 2020 | PODS | 5.7866368e-05 |
| 8,259 | Tuple-Independent Representations of Infinite Probabilistic Databases | 2021 | PODS | 5.4574671e-05 |
| 8,699 | Counting Problems over Incomplete Databases | 2020 | PODS | 5.3829678e-05 |
| 8,837 | Coping with Incomplete Data: Recent Advances | 2020 | PODS | 5.3596619e-05 |
| 9,225 | Queries with Arithmetic on Incomplete Databases | 2020 | PODS | 5.3035385e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 22 | Data Integration: A Theoretical Perspective | 2002 | PODS | 0.00056204792 |
| 377 | Data Exchange: Getting to the Core | 2003 | PODS | 0.00019643793 |
| 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS | 0.00013481551 |
| 4,032 | On Relational Algebra With Marked Nulls | 1984 | PODS | 6.9453392e-05 |
| 4,432 | Data Exchange beyond Complete Data | 2011 | PODS | 6.7087209e-05 |
| 5,677 | Making SQL Queries Correct on Incomplete Databases: A Feasibility Study | 2016 | PODS | 6.1248899e-05 |
| 8,098 | Designing a Query Language for RDF: Marrying Open and Closed Worlds | 2016 | PODS | 5.4874656e-05 |
| 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 5.3335287e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 874 | On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases | 2003 | PODS |
| 2 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 3 | 2,509 | Foundations of Probabilistic Answers to Queries | 2005 | SIGMOD |
| 4 | 12,404 | Completeness of Queries over Incomplete Databases | 2011 | VLDB |
| 5 | 8,626 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS |
| 6 | 8,837 | Coping with Incomplete Data: Recent Advances | 2020 | PODS |
| 7 | 11,367 | Querying Incomplete Numerical Data: Between Certain and Possible Answers | 2023 | PODS |
| 8 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |
| 9 | 7,088 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS |
| 10 | 9,225 | Queries with Arithmetic on Incomplete Databases | 2020 | PODS |