## Abstract

We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded by k, and the number of terms satisfied by any assignment is at most j. After motivating the investigation of this class of DNF formulas, we present an algorithm that for any unknown RkSj DNF formula to be learned, with high probability finds a logically equivalent DNF formula using the well-studied protocol of equivalence and membership queries. The algorithm runs in polynomial time for k · j = O(log n/log log n), where n is the number of input variables.

Original language | English (US) |
---|---|

Pages (from-to) | 1515-1530 |

Number of pages | 16 |

Journal | SIAM Journal on Computing |

Volume | 27 |

Issue number | 6 |

DOIs | |

State | Published - Dec 1998 |

Externally published | Yes |

## Keywords

- Computational learning theory
- DNF
- Decision trees
- Learning

## ASJC Scopus subject areas

- Computer Science(all)
- Mathematics(all)