On the construction of parallel computers from various bases of Boolean functions
Theoretical Computer Science
Learning read-once formulas with queries
Journal of the ACM (JACM)
Learning Conjunctions of Horn Clauses
Machine Learning - Computational learning theory
Linear time deterministic learning of k-term DNF
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
When won't membership queries help?
Selected papers of the 23rd annual ACM symposium on Theory of computing
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Tractable constraints on ordered domains
Artificial Intelligence
Complexity of generalized satisfiability counting problems
Information and Computation
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Closure properties of constraints
Journal of the ACM (JACM)
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
Machine Learning
Machine Learning
The Inverse Satisfiability Problem
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraints, consistency and closure
Artificial Intelligence
Linguistic categorization and complexity
SIGMORPHON '12 Proceedings of the Twelfth Meeting of the Special Interest Group on Computational Morphology and Phonology
Hi-index | 0.00 |
Boolean formulas are known not to be PAC-predictable even with membership queries under some cryptographic assumptions. In this paper, we study the learning complexity of some subclasses of boolean formulas obtained by varying the basis of elementary operations allowed as connectives. This broad family of classes includes, as a particular case, general boolean formulas, by considering the basis given by {AND,OR,NOT}. We completely solve the problem. We prove the following dichotomy theorem: For any set of basic boolean functions, the resulting set of formulas is either polynomially learnable from equivalence queries or membership queries alone or else it is not PAC-predictable even with membership queries under cryptographic assumptions. We identify precisely which sets of basic functions are in which of the two cases. Furthermore, we prove than the learning complexity of formulas over a basis depends only on the absolute expressivity power of the class, ie., the set of functions that can be represented regardless of the size of the representation. In consequence, the same classiffication holds for the learnability of boolean circuits.