Learning and Verifying Quantified Boolean Queries by Example
Summary: Analyzes membership-query complexity for learning and verifying qhorn — conjunctions of quantified Horn expressions — via answer/non-answer questions. Presents optimal polynomial-time and polynomial-question algorithms for two qhorn subclasses under constant-bounded causal density. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 491 | Query by Output | 2009 | SIGMOD | 0.00021960753 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,005 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7315492e-05 |
| 3,678 | Providing Better Support for a Class of Decision Support Queries | 1996 | SIGMOD | 6.8482668e-05 |
| 6,273 | Determinacy of Real Conjunctive Queries. The Boolean Case | 2022 | PODS | 5.1270241e-05 |
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 12,364 | Query Evaluation with Soft-Key Constraints | 2008 | PODS | 4.1905499e-05 |
| 14,275 | On Analogical Query Processing in Logic Database | 1986 | VLDB | - |
| 10,903 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 4.1905499e-05 |
| 12,892 | Learning Efficient Query Processing Strategies | 1992 | PODS | 4.1905499e-05 |
| 6,094 | Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited | 1989 | SIGMOD | 5.2099705e-05 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |