Learning Boolean formulas

DOI10.1145/195613.195656MaRDI QIDQ4327633zbMATH OpenOpenAlexFDO

Authors Michael Kearns, Ming Li, Leslie G. Valiant

Publication date 10 April 1995

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195613.195656

zbMATH Keywords

group learningdistribution-free learning of Boolean formulas

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• Learning k-Term Monotone Boolean Formulae.
• On learning random DNF formulas under the uniform distribution
• scientific article; zbMATH DE number 4092808
• Learning Monotone Boolean Functions by Uniformly Distributed Examples
• On learning monotone DNF formulae under uniform distributions

Cited in

(25)

• An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees
• A geometric approach to leveraging weak learners
• On derandomization and average-case complexity of monotone functions
• PACS, simple-PAC and query learning
• Partial Occam's Razor and its applications
• Learning with restricted focus of attention
• A complete characterization of statistical query learning with applications to evolvability
• Learnability of exclusive-or expansion based on monotone DNF formulas
• Proper learning of \(k\)-term DNF formulas from satisfying assignments
• Genetic algorithm-based feature set partitioning for classification problems
• Learning Monotone Boolean Functions by Uniformly Distributed Examples
• Statistical computational learning
• Understanding one another: making out meanings with Boolean equations
• On the complexity of learning for spiking neurons with temporal coding.
• Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation
• scientific article; zbMATH DE number 2045447 (Why is no real title available?)
• Learning random monotone DNF
• Testing problems with sublearning sample complexity
• scientific article; zbMATH DE number 17552 (Why is no real title available?)
• Rule generation for classification: scalability, interpretability, and fairness
• Explaining AI decisions using efficient methods for learning sparse Boolean formulae
• On learning monotone DNF under product distributions
• On the learnability of disjunctive normal form formulas
• Fault trees from data: efficient learning with an evolutionary algorithm
• On learning monotone Boolean functions under the uniform distribution

This page was built for publication: Learning Boolean formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327633)