Learning Boolean functions with queries
From MaRDI portal
Recommendations
Cited in
(27)- Disjunctive models of Boolean category learning
- Learning Boolean functions in an infinite attribute space
- Learning from examples and membership queries with structured determinations
- Learning counting functions with queries
- Adaptive versus nonadaptive attribute-efficient learning
- An approach to guided learning of Boolean functions
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- Active learning using arbitrary binary valued queries
- A representation of antimatroids by Horn rules and its application to educational systems
- Exact learning from an honest teacher that answers membership queries
- Active learning of recursive functions by ultrametric algorithms
- A theory of inductive query answering
- Probabilistic learning and Boolean functions
- Representing and learning Boolean functions of multivalued features
- An Algebraic Perspective on Boolean Function Learning
- scientific article; zbMATH DE number 67809 (Why is no real title available?)
- scientific article; zbMATH DE number 1104345 (Why is no real title available?)
- scientific article; zbMATH DE number 1163915 (Why is no real title available?)
- Algorithms for Boolean Function Query Properties
- scientific article; zbMATH DE number 2033228 (Why is no real title available?)
- scientific article; zbMATH DE number 6129640 (Why is no real title available?)
- Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
- New Computational Paradigms
- Learning concepts definable in first-order logic with counting
- The parameterized complexity of learning monadic second-order logic
- Learning aggregate queries defined by first-order logic with counting
- Learning Boolean specifications
This page was built for publication: Learning Boolean functions with queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081624)
