On the non-efficient PAC learnability of conjunctive queries (Q6072217): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning closed Horn expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Homomorphism Problem and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning schema mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5381121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for learning quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability of quantified formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of models for polynomial learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction-hardness of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of inductive logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Revision as of 04:21, 3 August 2024

scientific article; zbMATH DE number 7749692
Language Label Description Also known as
English
On the non-efficient PAC learnability of conjunctive queries
scientific article; zbMATH DE number 7749692

    Statements

    On the non-efficient PAC learnability of conjunctive queries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    computational learning theory
    0 references
    conjunctive queries
    0 references
    inductive logic programming
    0 references
    databases
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references