Amanote Research

Amanote Research

  • Register
  • Sign In

Learning and Verifying Quantified Boolean Queries by Example

doi 10.1145/2463664.2465220

Full Text

Abstract

Available in

Date

January 1, 2013

Authors

Azza AbouziedDana AngluinChristos PapadimitriouJoseph M. HellersteinAvi Silberschatz

Publisher

ACM Press


Related search

Semantic Queries by Example

2013English

Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Nonmonotonic Reasoning With Quantified Boolean Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Verifying Spatial Queries Using Voronoi Neighbors

2010English

Propositional PSPACE Reasoning With Boolean Programs Versus Quantified Boolean Formulas

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Fuzzy Quantified Queries to Fuzzy RDF Databases

2017English

Queries and Concept Learning

Machine Learning
Artificial IntelligenceSoftware
1988English

A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy