Pages that link to "Item:Q2506483"
From MaRDI portal
The following pages link to Exact learning Boolean functions via the monotone theory (Q2506483):
Displaying 50 items.
- Improved time complexities for learning Boolean networks (Q280576) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- On learning monotone Boolean functions under the uniform distribution (Q817825) (← links)
- Efficient multiple constraint acquisition (Q823769) (← links)
- Learning Boolean specifications (Q900315) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
- Learning Boolean functions in an infinite attribute space (Q1206444) (← links)
- Efficient learning with equivalence queries of conjunctions of modulo functions (Q1350223) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Exact learning of linear combinations of monotone terms from function value queries (Q1367523) (← links)
- Conjunctions of unate DNF formulas: Learning and structure (Q1383160) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- On parallel attribute-efficient learning. (Q1401979) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- Almost all monotone Boolean functions are polynomially learnable using membership queries (Q1603482) (← links)
- Automated circular assume-guarantee reasoning (Q1673656) (← links)
- Sampling frequent and minimal Boolean patterns: theory and application in classification (Q1741140) (← links)
- Guided inference of nested monotone Boolean functions (Q1810471) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Properties of quasi-Boolean function on quasi-Boolean algebra (Q1937909) (← links)
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries (Q1961324) (← links)
- A dichotomy theorem for learning quantified Boolean formulas (Q1964325) (← links)
- Learning of bounded-weight Boolean functions (Q2131413) (← links)
- Grafting for combinatorial binary model using frequent itemset mining (Q2218401) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Learning attribute-efficiently with corrupt oracles (Q2465035) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Learning taxonomic relation by case-based reasoning (Q2581362) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- PAC learning under helpful distributions (Q2771492) (← links)
- Minimizing the average query complexity of learning monotone Boolean functions (Q2884531) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES (Q4020280) (← links)
- Learning k-Term Monotone Boolean Formulae. (Q4244821) (← links)
- (Q4420746) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Automatically inferring loop invariants via algorithmic learning (Q5740643) (← links)
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference (Q5892496) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- Learning a circuit by injecting values (Q5920703) (← links)
- Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme (Q5941373) (← links)
