Learning first-order definable concepts over structures of small degree
From MaRDI portal
Recommendations
Cited in
(18)- Inductive general game playing
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- Regularizing conjunctive features for classification
- On finding a first-order sentence consistent with a sample of strings
- scientific article; zbMATH DE number 1149407 (Why is no real title available?)
- scientific article; zbMATH DE number 2077158 (Why is no real title available?)
- scientific article; zbMATH DE number 2086423 (Why is no real title available?)
- Learning definable hypotheses on trees
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Training digraphs
- Learning concepts described by weight aggregation logic
- Learning concepts definable in first-order logic with counting
- Learnability and definability in trees and similar structures
- The parameterized complexity of learning monadic second-order logic
- Learning aggregate queries defined by first-order logic with counting
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
This page was built for publication: Learning first-order definable concepts over structures of small degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144626)