Learning concepts described by weight aggregation logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 6999908 (Why is no real title available?)
- scientific article; zbMATH DE number 795584 (Why is no real title available?)
- scientific article; zbMATH DE number 7561484 (Why is no real title available?)
- A theory of the learnable
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Elements of finite model theory.
- First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
- Gaifman normal forms for counting extensions of first-order logic
- Learnability and definability in trees and similar structures
- Learning concepts definable in first-order logic with counting
- Learning first-order definable concepts over structures of small degree
- Logic, graphs, and algorithms
- Queries and concept learning
- Understanding machine learning. From theory to algorithms
Cited in
(3)
This page was built for publication: Learning concepts described by weight aggregation logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839830)