Conjunctive queries: unique characterizations and exact learnability
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2080453 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- An introduction to description logic
- Degrees of acyclicity for hypergraphs and relational database schemes
- Duality theorems for finite structures (characterising gaps and good characterisations)
- First-order queries on classes of structures with bounded expansion
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Learning join queries from user examples
- Learning schema mappings
- Pac-learning non-recursive Prolog clauses
- Queries and concept learning
- Querying the Guarded Fragment
- Schema mapping discovery from data instances
- Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality
- Sparsity. Graphs, structures, and algorithms
- The complexity of reverse engineering problems for conjunctive queries
- The core of a graph
- The data complexity of description logic ontologies
- The product homomorphism problem and applications
This page was built for publication: Conjunctive queries: unique characterizations and exact learnability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229581)
