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

TitleRead-Once Threshold Formulas, Justifying Assignments, and Generic Tranformations
Publication TypeTechnical Report
Year of Publication1992
AuthorsBshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M.
Other Numbers725
Keywordslearning algorithms, Queries, Read-Once Formulas, Threshold Functions
Abstract

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 series of generic transfor- mations that can be used to convert an algorithm in one learning model into an algorithm in a different model.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1992/tr-92-020.pdf
Bibliographic Notes

ICSI Technical Report TR-92-020

Abbreviated Authors

N. H. Bshouty, T. R. Hancock, L. Hellerstein, and M. Karpinski

ICSI Publication Type

Technical Report