Database Paper Browser

Back to papers

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)

Paper ID
1603
Venue
PODS
Year
2013
Pagerank
8.176296e-05
Overall Rank
2,750 | 80.88%
DOI
-

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
492 Query by Output 2009 SIGMOD 0.00021974699
Previous Page 1 / 1 Next

Semantically Similar Papers