Learning aggregate queries defined by first-order logic with counting

Cites work

A characterization of multiclass learnability
Algorithmic meta-theorems
Algorithmic uses of the Feferman-Vaught theorem
Complexity theoretic hardness results for query learning
Conjunctive queries: unique characterizations and exact learnability
Deciding first-order properties of nowhere dense graphs
First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
scientific article; zbMATH DE number 3819693 (Why is no real title available?)
scientific article; zbMATH DE number 2080453 (Why is no real title available?)
scientific article; zbMATH DE number 6999908 (Why is no real title available?)
scientific article; zbMATH DE number 784360 (Why is no real title available?)
ICE-based refinement type discovery for higher-order functional programs
Inductive logic programming
Inductive logic programming at 30
Inductive Logic Programming: Theory and methods
Learnability and definability in trees and similar structures
Learning Boolean functions with queries
Learning concepts definable in first-order logic with counting
Learning concepts described by weight aggregation logic
Learning definable hypotheses on trees
Learning first-order definable concepts over structures of small degree
Learning join queries from user examples
Learning schema mappings
Logic, graphs, and algorithms
Parametrized complexity theory.
Queries and concept learning
Regularizing conjunctive features for classification
Schema mapping discovery from data instances
The complexity of reverse engineering problems for conjunctive queries
The first order properties of products of algebraic systems
Understanding machine learning. From theory to algorithms

This page was built for publication: Learning aggregate queries defined by first-order logic with counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292768)