Read-twice DNF formulas are properly learnable
From MaRDI portal
Publication:2508329
Recommendations
Cited in
(23)- A linear time equivalence test for read-twice DNF formulas
- Learning from examples with unspecified attribute values.
- Exact learning of multivalued dependency formulas
- Learning Boolean read-once formulas over generalized bases
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Learning read-constant polynomials of constant degree modulo composites
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- Learning an extension of the class of functional dependencies with queries
- Exact Learning of Multivalued Dependencies
- scientific article; zbMATH DE number 67616 (Why is no real title available?)
- Learning read-once formulas with queries
- On Learning Read-k-Satisfy-j DNF
- scientific article; zbMATH DE number 1256690 (Why is no real title available?)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- On learning multivalued dependencies with queries
- Exact learning of DNF formulas using DNF hypotheses
- An optimal algorithm for proper learning of unions of two rectangles with queries
- Exact learning of subclasses of CDNF formulas with membership queries
- On the limits of proper learnability of subclasses of DNF formulas
- Theory revision with queries: Horn, read-once, and parity formulas
- Fast learning of \(k\)-term DNF formulas with queries.
This page was built for publication: Read-twice DNF formulas are properly learnable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508329)
