Answer counting under guarded TGDs
From MaRDI portal
Cites work
- A trichotomy in the complexity of counting answers to conjunctive queries
- An introduction to description logic
- Counting Answers to Existential Questions
- Data exchange: semantics and query answering
- Fast query answering over existential rules
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Linking Data to Ontologies
- On rules with existential variables: walking the decidability line
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Semantic Optimization of Conjunctive Queries
- Semantically Acyclic Conjunctive Queries under Functional Dependencies
- Structural tractability of counting of solutions to conjunctive queries
- Taming the infinite chase: query answering under expressive relational constraints
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The complexity of counting homomorphisms seen from the other side
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of weighted counting for acyclic conjunctive queries
- The Parameterized Complexity of Counting Problems
- Towards more expressive ontology languages: the query answering problem
- Tractable counting of the answers to conjunctive queries
- When is ontology-mediated querying efficient?
This page was built for publication: Answer counting under guarded TGDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229584)
