Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results


We consider the class 77,2, consisting of conjunctions of two unate DNF formulas. This class is a generalization of the class of 2-clause CNF formulas, and of the class of unate DNF formulas, both of which are properly learnable in polynomial time with membership and equivalence queries. We show that 7?2 can be properly learned with a polynomial number of… (More)
DOI: 10.1145/238061.238112


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics