A Dichotomy Theorem for Learning Quantified Boolean Formulas

Author： Dalmau V.  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.35, Iss.3, 1999-06, pp. : 207-224

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Boolean Functions as Models for Quantified Boolean Formulas

By Kleine Büning Hans   Subramani K.   Zhao Xishun  

Journal of Automated Reasoning, Vol. 39, Iss. 1, 2007-07 ,pp. : 49-75

Springer Publishing Company

Access to resources Recommend Favorite

Learnability of quantified formulas

By Dalmau V.   Jeavons P.  

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 485-511

Elsevier

Access to resources Recommend Favorite

Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems

By Kosub Sven  

Mathematics in Computer Science, Vol. 1, Iss. 3, 2008-03 ,pp. : 487-505

Springer Publishing Company

Access to resources Recommend Favorite

Exact Learning of Formulas in Parallel

By Bshouty N.H.  

Machine Learning, Vol. 26, Iss. 1, 1997-01 ,pp. : 25-41

Springer Publishing Company

Access to resources Recommend Favorite

Boolean Feature Discovery in Empirical Learning

By Pagallo G.  

Machine Learning, Vol. 05, Iss. 1, 1990-03 ,pp. : 71-99

Springer Publishing Company

Access to resources Recommend Favorite