Amanote Research
Register
Sign In
Learning and Verifying Quantified Boolean Queries by Example
doi 10.1145/2463664.2465220
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2013
Authors
Azza Abouzied
Dana Angluin
Christos Papadimitriou
Joseph M. Hellerstein
Avi Silberschatz
Publisher
ACM Press
Related search
Semantic Queries by Example
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Computational Theory
Software
Artificial Intelligence
Mathematics
Nonmonotonic Reasoning With Quantified Boolean Constraints
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Verifying Spatial Queries Using Voronoi Neighbors
Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fuzzy Quantified Queries to Fuzzy RDF Databases
Queries and Concept Learning
Machine Learning
Artificial Intelligence
Software
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving
Proceedings of the AAAI Conference on Artificial Intelligence
Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science