Learning concepts definable in first-order logic with counting
From MaRDI portal
Cites work
- A Faster Isomorphism Test for Graphs of Small Degree
- A theory of the learnable
- Complexity theoretic hardness results for query learning
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Deterministic stateless centralized local algorithms for bounded degree graphs
- Elements of finite model theory.
- Enumerating answers to first-order queries over databases of low degree
- Faster Property Testers in a Variation of the Bounded Degree Model
- First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
- scientific article; zbMATH DE number 1688350 (Why is no real title available?)
- 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?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 3266604 (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
- Learnability and the Vapnik-Chervonenkis dimension
- 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 schema mappings
- Local algorithms for sparse spanning graphs
- Local computation algorithms for graphs of non-constant degrees
- On monadic NP vs monadic co-NP
- Parametrized complexity theory.
- Property testing for bounded degree databases
- Property testing in bounded degree graphs
- Queries and concept learning
- Query evaluation via tree-decompositions
- Regularizing conjunctive features for classification
- Schema mapping discovery from data instances
- Size bounds and query plans for relational joins
- The complexity of reverse engineering problems for conjunctive queries
- Tools and algorithms for the construction and analysis of systems. 22nd international conference, TACAS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016. Proc
- Understanding machine learning. From theory to algorithms
This page was built for publication: Learning concepts definable in first-order logic with counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925627)
