Dichotomy theorem for learning quantified boolean formulas

Machine Learning

Volumn 35, Issue 3, 1999, Pages 207-224

  Dalmau, Víctor ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; EQUIVALENCE CLASSES; MEMBERSHIP FUNCTIONS; POLYNOMIALS; THEOREM PROVING;

DICHOTOMY THEOREM;

LEARNING SYSTEMS;

EID: 0032632466     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007582729656     Document Type: Article

References (21)

1. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
2. Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of horn clauses. Machine Learning, 9, 147-164.
3. Angluin, D., & Kharitonov, M. (1995). When won't membership queries help? Journal of Computer and System Sciences, 50, 336-355.
4. Berggren, U. (1993). Linear time deterministic learning of k-term DNF. Proc. 6th Annual Workshop on Computational Learning Theory (pp. 37-40).
5. Chen, Z., & Homer, S. (1997). Learning counting functions with queries. Theoretical Computer Science, 180, 155-168.
6. Creignou, N. (1995). A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 57(3), 511-522.
7. Creignou, N., & Hermann, M. (1996). Complexity of generalized satisfiability counting problems. Information and Computation, 125, 1-12.
8. Dalmau, V. (1997). Some dichotomy theorems on constant-free quantified boolean formulas (Technical Report LSI-97-43-R), Department LSI, Universitat Politécnica de Catalunya.
9. Dor, D., & Tarsi, M. (1997). Graph decomposition is NP-complete: A complete proof of Holyer's conjecture. SIAM Journal on Computing, 26(4), 1166-1187.
10. Fortune, S., Hopcroft, J., & Wyllie, J. (1980). The directed subgraph homeomorphism problem. Theor. Comp. Sci., 81(2), 111-121.
11. Greenlaw, R., Hoover, H.J., & Ruzzo, W.L. (1995). Limits to Parallel Computation: P-completeness theory. Oxford University Press.
12. Hell, P., & Nešetřil, N. (1990). On the complexity of H-coloring. J. Combin. Theory Ser. B, 48, 92-110.
13. Kavvadias, D., & Sidderi, M. (1996). The inverse satisfiability problem. Proc. 2nd Annual International Conference on Computing and Combinatorics, COCOON'96 (pp. 250-259).
14. Kearns, M., & Valiant, L. (1994). Cryptographic limitations on learning boolean formulae and finite automata. J. ACM, 41(1), 67-95.
15. Khanna, S., Sudan, M., & Trevisan, L. (1997). Constraint satisfaction: The approximability of minimization problems. Proc. of the 12th IEEE Conference on Computational Complexity.
16. Khanna, S., Sudan, M., & Williamson, P. (1997). A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. Proc. of the 29th Annual ACM Symposium on the Theory of Computing.
17. Maass, W., & Turán, G. (1995). On learnability and predicate logic. Proc. Bar-Ilan Symposium on the Foundations of Artificial Intelligence, BISFAI'95 (pp. 75-85).
18. Papadimitriou, C.H. (1994). Computational Complexity. Addison-Wesley.
19. Pitt, L., & Warmuth, M. (1990). Prediction preserving reducibility. Journal of Computer and System Sciences, 41, 430-467.
20. Schaefer, T.J. (1978). The complexity of satisfiability problems. Proc. 10th Annual ACM Symposium on Theory of Computing (pp. 216-226).
21. Valiant, L. (1984). A theory of the learnable. Comm. ACM, 27, 1134-1142.