Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/83484
Título:
|
A Dichotomy theorem for learning quantified Boolean formulas
|
Autor/a:
|
Dalmau Lloret, Víctor
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
We consider the following classes of quantified boolean formulas. Fix
a finite set of basic boolean functions. Take conjunctions
of these basic functions applied to variables and constants in
arbitrary way. Finally quantify existentially or universally some of
the variables. We prove the following dichotomy theorem: For
any set of basic boolean functions, the resulting set of formulas is
either polynomially learnable from equivalence queries alone or else it is
not PAC-predictable even with membership queries under
cryptographic assumptions. Furthermore we
identify precisely which sets of basic functions are in which
of the two cases. |
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Dichotomy theorem -Boolean formulas |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Informe |
Compartir:
|
|
Mostrar el registro completo del ítem