Learnability and definability in trees and similar structures

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

Volumn 2285, Issue , 2002, Pages 645-657

  Grohe, Martin ^a   Turán, Gyorgy ^b,c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c Research Group on AI of the Hungarian Academy of Sciencese   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

COMBINATORIAL PARAMETERS; DEFINABILITY PROBLEMS; EQUIVALENCE QUERIES; FINITE RELATIONAL STRUCTURES; FIRST-ORDER FORMULAS; SECOND ORDERS; STRONG CONSISTENCY; TREE AUTOMATA;

FORESTRY;

PROBLEM SOLVING; STRUCTURES; TREES;

EID: 84937399555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_53     Document Type: Conference Paper

References (31)

1. H. Aizenstein, T. Hegediis, L. Hellerstein, and L. Pitt. Complexity-theoretic hardness results for query learning. Computational Complexity, 7:19-53, 1998.
2. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
3. J.L. Balcazar. The consistency dimension, compactness and query learning. In J. Flum and M. Rodriguez-Artalejo, editors, Computer Science Logic, 13th International Workshop CSL’99, volume 1683 of Lecture Notes in Computer Science, pages 2-13. Springer-Verlag, 1999.
4. J.L. Balcazar, J. Castro, D. Guijarro, and H.U. Simon. The consistency dimension and distribution- dependent learning from queries. In O. Watanabe and T. Yokomori, editors, Algorithmic Learning Theory, 10th International Conference, ALT’99, volume 1720 of Lecture Notes in Computer Science, pages 77-92. Springer-Verlag, 1999.
5. M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. A model-theoretic approach to regular string relations. In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, pages 431–440, 2001.
6. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929-965, 1989.
7. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218-270, 1993.
8. B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics, 101:77-114,2000.
9. D. Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27:275-291, 2000.
10. H. Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium’81. North Holland, 1982.
11. M. Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica. To appear.
12. M. Grohe. Generalized model-checking problems for first-order logic. In H. Reichel and A. Ferreira, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pages 12-26. Springer-Verlag, 2001.
13. M. Grohe and Gy. Turan. Learnability and definability in trees and similar structures. Currently available at http://www.dcs.ed.ac.uk/home/grohe/pub.html.
14. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, and D. Wilkins. How many queries are needed to learn? Journal of the ACM, 43:840-862, 1996.
15. W. Hodges. Model Theory. Cambridge University Press, 1993.
16. M.J. Kearns and U. VVazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
17. M.C. Laskowski. Vapnik-Chervonenkis classes of definable sets. Journal of the London Mathematical Society (2), 45:377-384, 1992.
18. W. Maass and Gy. Turan. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145, 1992.
19. W. Maass and Gy. Turan. On learnability and predicate logic. In Proceedings of the Bar-Ilan Symposium on the Foundations of Artificial Intelligence (BISFAI-95), pages 75-85, 1995.
20. S.-H. Nienhuys-Cheng and R. deWolf. Foundations of Inductive Logic Programming, volume 1228 of Lecture Notes in Computer Science. Springer-Verlag, 1997.
21. D.N. Osherson, M. Stob, and S. Weinstein. New directions in automated scientific discovery. Information Sciences, 57-58:217-230, 1991.
22. K.P. Podewski and M. Ziegler. Stable graphs. Fundamenta Mathematicae, 100:101-107, 1978.
23. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
24. N. Robertson and P.D. Seymour. Graph minors V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41:92–114, 1986.
25. N. Sauer. On the density of families of sets. Jornal of Combinatorial Theory, Series A, 13:145-147, 1972.
26. S. Shelah. Stability, the f.c.p. and superstability. Annals of Mathematical Logic, 3:271-362, 1971.
27. S. Shelah. A combinatorial problem: stability and order for models and theories in infinitary languages. Pacific Journal of Mathematics, 41:241-261, 1972.
28. J.W. Thatcher and J.B. Wright. Generalised finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2:57-81, 1968.
29. I.T. Saparaand G. Turan. Learning atomic formulas with prescribed properties. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory (COLT’98), pages 166-174, 1998.
30. L. van den Dries. Tame Topology and O-minimal Structures. Cambridge University Press, 1998.
31. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.