Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
New directions in automated scientific discovery
Information Sciences: an International Journal - Special issue on information sciences—past, present, and future
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
An introduction to computational learning theory
An introduction to computational learning theory
How many queries are needed to learn?
Journal of the ACM (JACM)
Learning atomic formulas with prescribed properties
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Complexity theoretic hardness results for query learning
Computational Complexity
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Machine Learning
Machine Learning
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
The Consistency Dimension, Compactness, and Query Learning
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Model-Theoretic Approach to Regular String Relations
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity parameters for first order classes
Machine Learning
| Hi-index | 0.00 |
We prove upper bounds for combinatorial parameters of finite relational structures, related to the complexity of learning a definable set. We show that monadic second order (MSO) formulas with parameters have bounded VC-dimension over structures of bounded clique-width, and first-order formulas with parameters have bounded VC-dimension over structures of bounded local clique-width (this includes planar graphs). We also show that MSO formulas of a fixed size have bounded strong consistency dimension over MSO formulas of a fixed larger size, for colored trees. These bound simply positive learnability results for the PAC and equivalence query learnability of a definable set over these structures. The proofs are based on bounds for related definability problems for tree automata.