Learnability of quantified formulas. (Q1426470): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Learning conjunctions of Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interpolation and the Chinese remainder theorem for algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning Boolean functions via the monotone theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning counting functions with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising tractable constraints / 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: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints, consistency and closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable constraints on ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Logic Programming: Theory and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction-preserving reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281057 / rank
 
Normal rank

Revision as of 14:54, 6 June 2024

scientific article
Language Label Description Also known as
English
Learnability of quantified formulas.
scientific article

    Statements

    Learnability of quantified formulas. (English)
    0 references
    14 March 2004
    0 references
    Computational learning
    0 references
    Quantified formulas
    0 references
    Clones
    0 references
    0 references
    0 references

    Identifiers