Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpiński · 1991

We present a membership query (i.e. interpolation) algorithm for exactly identifying the class of read-once formulas over the basis of boolean threshold functions. Using a generic transformation from [Angluin, Hellerstein, Karpinski 89], this gives an algorithm using membership and equivalence queries for exactly identifying the class of read-once formulas over the basis of boolean threshold functions and negation. We also present a a series of generic transformations that can be used to convert an algorithm in one learning model into an algorithm in a different model.

Read the paper · More papers on PaperTik