Mostra el registre d'ítem simple
Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
dc.contributor.author | Pitt, L. |
dc.contributor.author | Mishra, N. |
dc.contributor.author | Domingo Soriano, Carlos |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-03-16T16:21:39Z |
dc.date.available | 2016-03-16T16:21:39Z |
dc.date.issued | 1998-07-01 |
dc.identifier.uri | http://hdl.handle.net/2117/84536 |
dc.description.abstract | We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (``read-k'' monotone CNF). Let f: {0,1}^n ----->{0,1} be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomial time algorithm for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f. The algorithm's only method of obtaining information about f is through membership queries, i.e., by inquiring about the value f(x) for points x in {0,1}^n. The algorithm yields an incremental polynomial output time solution to the bounded degree hypergraph transversal problem, and the problem of (read-k) monotone CNF/DNF dualization, which remain open problems of importance in the unrestricted case. |
dc.format.extent | 26 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-98-43-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | CFN |
dc.subject.other | DNF |
dc.subject.other | Learning monotone |
dc.subject.other | Membership queries |
dc.title | Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1901893 |
dc.description.version | Postprint (published version) |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]