Pages that link to "Item:Q2508329"
From MaRDI portal
The following pages link to Read-twice DNF formulas are properly learnable (Q2508329):
Displaying 19 items.
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas (Q264959) (← links)
- Learning an extension of the class of functional dependencies with queries (Q264983) (← links)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries (Q503461) (← links)
- On learning multivalued dependencies with queries (Q533874) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Fast learning of \(k\)-term DNF formulas with queries. (Q960515) (← links)
- A linear time equivalence test for read-twice DNF formulas (Q1334630) (← links)
- Conjunctions of unate DNF formulas: Learning and structure (Q1383160) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- Exact learning of multivalued dependency formulas (Q1704556) (← links)
- Learning Boolean read-once formulas over generalized bases (Q1894458) (← links)
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948) (← links)
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries (Q1961324) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- Exact Learning of Multivalued Dependencies (Q2835618) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)
