Complexity parameters for first order classes
From MaRDI portal
Recommendations
Cites work
- A general lower bound on the number of examples needed for learning
- First-order \(jk\)-clausal theories are PAC-learnable
- How many queries are needed to learn?
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1104356 (Why is no real title available?)
- scientific article; zbMATH DE number 1149414 (Why is no real title available?)
- scientific article; zbMATH DE number 2086423 (Why is no real title available?)
- Inductive Logic Programming: Theory and methods
- Learnability and the Vapnik-Chervonenkis dimension
- Learning action strategies for planning domains
- Learning closed Horn expressions
- Learning function-free Horn expressions
- Learning logic programs with structured background knowledge
- Logical settings for concept-learning
- Lower bound methods and separation results for on-line learning models
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Polynomial certificates for propositional classes.
- Subsumption and implication
This page was built for publication: Complexity parameters for first order classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433181)