Learnability of solutions to conjunctive queries
From MaRDI portal
Recommendations
Cites work
- A dichotomy theorem for learning quantified Boolean formulas
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- An algebraic characterization of testable Boolean CSPs
- Asking the Metaquestions in Constraint Tractability
- Classifying the Complexity of Constraints Using Finite Algebras
- Complexity classifications of Boolean constraint satisfaction problems
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Cryptographic limitations on learning Boolean formulae and finite automata
- Exact learning from membership queries: some techniques, results and new directions
- Existence theorems for weakly symmetric operations
- Exploring learnability between exact and PAC
- Finitely related algebras in congruence modular varieties have few subpowers
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 4035895 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Learnability of quantified formulas.
- Learnability of solutions to conjunctive queries
- Learning closed Horn expressions
- Learning conjunctions of Horn clauses
- Learning intersection-closed classes with signatures
- Meditations on quantified constraint satisfaction
- On learning random DNF formulas under the uniform distribution
- On the algebraic structure of combinatorial problems
- ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
- On the expression complexity of equivalence and isomorphism of primitive positive formulas
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Prediction-preserving reducibility
- Queries and concept learning
- Size-depth tradeoffs for Boolean formulae
- The complexity of satisfiability problems
- The complexity of satisfiability problems: Refining Schaefer's theorem
- The complexity of the counting constraint satisfaction problem
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The structure of finite algebras
- Tractability and learnability arising from algebras with few subpowers
- Varieties Obeying Homotopy Laws
- Varieties with few subalgebras of powers
- When won't membership queries help?
Cited in
(15)- Parameterized learnability of juntas
- Necessary and sufficient conditions for learning with correction queries
- Learnability of quantified formulas.
- The consistency dimension and distribution-dependent learning from queries.
- Prediction-hardness of acyclic conjunctive queries
- Regularizing conjunctive features for classification
- scientific article; zbMATH DE number 67621 (Why is no real title available?)
- Structural analysis of polynomial-time query learnability
- scientific article; zbMATH DE number 2080453 (Why is no real title available?)
- scientific article; zbMATH DE number 6999904 (Why is no real title available?)
- Learnability of solutions to conjunctive queries
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
- Algorithmic Learning Theory
- On the non-efficient PAC learnability of conjunctive queries
- Symmetries and complexity (invited talk)
This page was built for publication: Learnability of solutions to conjunctive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5381121)
