Generalized graph colorability and compressibility of boolean formulae

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 237-246

  Nock, Richard ^a   Jappy, Pascal ^a   Sallantin, Jean ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

BOOLEAN FORMULAE; COLORABILITY; DISJUNCTIVE NORMAL FORM; DNF FORMULAS; GENERALIZED GRAPHS; LOWER BOUNDS; OCCAM'S RAZOR; THREE PARAMETERS;

BOOLEAN ALGEBRA;

EID: 84867450200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_26     Document Type: Conference Paper

References (36)

1. th International Conference on Computational Learning Theory, pages 71-76, 1992.
2. H. Aizenstein and L. Pitt. On the learnability of Disjunctive Normal Form formulas. Machine Learning, 19:183-208, 1995.
3. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural Complexity I. Springer Verlag, 1988.
4. th International Conference on Computational Learning Theory, pages 37-40, 1993.
5. th International Conference on Computational Learning Theory, pages 110-117, 1994.
6. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, pages 377-380, 1987.
7. th International Conference on Machine Learning, 1991.
8. th International Conference on Computational Learning Theory, pages 198-205, 1995.
9. W. W. Cohen. PAC-learning a restricted class of recursive logic programs. In Proc. of AAAI-93, pages 86-92, 1993.
10. th International Conference on Machine Learning, pages 115-123, 1995.
11. C. de la Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, pages 1-14, 1997.
12. L. de Raedt. Iterative concept learning and construction by analogy. Machine Learning, pages 107-150, 1992.
13. U. Feige and J. Kilian. Zero knowledge and the chromatic number. draft, 1996.
14. M.R. Garey and D.S. Johnson. Computers and Intractability, a guide to the theory of NP-Completeness. Bell Telephone Laboratories, 1979.
15. th International Conference on Computational Learning Theory, pages 77-84, 1992.
16. 1-ε. In FOCS'96, pages 627-636, 1996.
17. R.C. Holte. Very simple classification rules perform well on most commonly used datasets. Machine Learning, pages 63-91, 1993.
18. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. M.I.T. Press, 1994.
19. M.J. Kearns, M. Li, L. Pitt, and L. Valiant. On the learnability of boolean formulae. Proceedings of the Nineteenth Annual A.C.M. Symposium on Theory of Computing, pages 285-295, 1987.
20. R. Khardon. On using the fourier transform to learn disjoint DNF. Information Processing Letters, pages 219-222, 1994.
21. N. Lavrac, S. Dzeroski, and M. Grobelnik. Learning non-recursive definitions of relations withlinus. In European Working Session in Learning, 1991.
22. th Symposium on the Theory of Computing, pages 286-293, 1993.
23. th International Conference on Computational Learning Theory, pages 53-61, 1992.
24. S. Muggleton and C. Feng. Efficient induction of logic programs. In Inductive Logic Programming, 1994.
25. th International Conference on Machine Learning, pages 413-420, 1995.
26. J. Pagallo and D. Haussler. Boolean feature discovery in empirical learning. Machine Learning, 1990.
27. th International Conference on Computational Learning Theory, pages 118-129, 1994.
28. L. Pitt and L. G. Valiant. Computational limitations on learning from examples. J. ACM, pages 965-984, 1988.
29. J. R. Quinlan. Learning logical definition from relations. Machine Learning, pages 239-270, 1990.
30. J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann, 1994.
31. th International Conference on Machine Learning, pages 464-470, 1995.
32. C. Rouveirol. ITOU: induction of first-order theories. Inductive Logic Programming, 1992.
33. S. B. Thrun, J. Bala, E. Bloedorn, I. Bratko, B. Cestnik, J. Cheng, K. De Jong, S. Dzeroski, S. E. Fahlman, D. Fisher, R. Hamann, K. Kaufman, S. Keller, I. Kononenko, J. Kreuziger, R. S. Michalski, T. Mitchell, P. Pachowicz, Y. Reich, H. Vafaie, W. Van de Welde, W. Wenzel, J. Wnek, and J. Zhang. The MONK's problems: a performance comparison of different lear ning algorithms. Technical Report CMU-CS-91-197, Carnegie Mellon University, 1991.
34. L. G. Valiant. A theory of the learnable. Communications of the ACM, pages 1134-1142, 1984.
35. th IJCAI, pages 560-566, 1985.
36. th IJCAI, 1991.