Exact learning Boolean functions via the monotone theory
From MaRDI portal
Publication:2506483
DOI10.1006/inco.1995.1164zbMath1096.68634OpenAlexW1969880832MaRDI QIDQ2506483
Publication date: 10 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6309d72986aa89e85640c136ad5ba7c35f836df9
Related Items
Efficient multiple constraint acquisition ⋮ Improved time complexities for learning Boolean networks ⋮ On learning monotone DNF under product distributions ⋮ What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Simple learning algorithms using divide and conquer ⋮ Automated circular assume-guarantee reasoning ⋮ Conjunctions of unate DNF formulas: Learning and structure ⋮ Defaults and relevance in model-based reasoning ⋮ Properties of quasi-Boolean function on quasi-Boolean algebra ⋮ Variations on extending partially defined Boolean functions with missing bits. ⋮ Learning from examples with unspecified attribute values. ⋮ Learning constraints through partial queries ⋮ Invariant inference with provable complexity from the monotone theory ⋮ SAT-based invariant inference and its relation to concept learning ⋮ Exact learning of subclasses of CDNF formulas with membership queries ⋮ The monotone theory for the PAC-model. ⋮ Grafting for combinatorial binary model using frequent itemset mining ⋮ Learnability of quantified formulas. ⋮ Sampling frequent and minimal Boolean patterns: theory and application in classification ⋮ Learning attribute-efficiently with corrupt oracles ⋮ Automatically inferring loop invariants via algorithmic learning ⋮ PAC Learning under Helpful Distributions ⋮ Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme ⋮ Learning conditional preference networks ⋮ Exact learning of DNF formulas using DNF hypotheses ⋮ Decision tree approximations of Boolean functions ⋮ Translation among CNFs, characteristic models and ordered binary decision diagrams ⋮ Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference ⋮ Learning large-alphabet and analog circuits with value injection queries ⋮ Learning a circuit by injecting values ⋮ Structural results about exact learning with unspecified attribute values ⋮ The learnability of exclusive-or expansions based on monotone DNF formulas ⋮ Learning DNF from random walks ⋮ The query complexity of finding local minima in the lattice ⋮ Learning taxonomic relation by case-based reasoning ⋮ Almost all monotone Boolean functions are polynomially learnable using membership queries ⋮ Theory revision with queries: Horn, read-once, and parity formulas
