Prediction-hardness of acyclic conjunctive queries
From MaRDI portal
Publication:2581365
DOI10.1016/J.TCS.2005.09.006zbMATH Open1081.68016OpenAlexW2088471214MaRDI QIDQ2581365FDOQ2581365
Authors: Kouichi Hirata 
Publication date: 10 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.006
Recommendations
PredictionInductive logic programmingSubsumptionAcyclic conjunctive queryPrediction-preserving reduction
Cites Work
- Title not available (Why is that?)
- A theory of the learnable
- On the Desirability of Acyclic Database Schemes
- The complexity of acyclic conjunctive queries
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Cryptographic limitations on learning Boolean formulae and finite automata
- Conjunctive query containment revisited
- Degrees of acyclicity for hypergraphs and relational database schemes
- Subsumption and implication
- Prediction-preserving reducibility
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning action strategies for planning domains
- Learning function-free Horn expressions
- First-order \(jk\)-clausal theories are PAC-learnable
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pac-learning non-recursive Prolog clauses
- Learning logic programs with structured background knowledge
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Prediction-hardness of acyclic conjunctive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581365)
