Answer Counting under Guarded TGDs
From MaRDI portal
Publication:6076172
DOI10.46298/lmcs-19(3:16)2023arXiv2101.03058OpenAlexW3120529697MaRDI QIDQ6076172
Marcin Przybyłko, Carsten Lutz, Cristina Feier
Publication date: 23 October 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.03058
approximation schemestuple generating dependenciesparametrised complexityontology mediated queriescounting answers
Cites Work
- Unnamed Item
- Structural tractability of counting of solutions to conjunctive queries
- Towards more expressive ontology languages: the query answering problem
- Tractable counting of the answers to conjunctive queries
- The complexity of weighted counting for acyclic conjunctive queries
- Data exchange: semantics and query answering
- On rules with existential variables: walking the decidability line
- The complexity of counting homomorphisms seen from the other side
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- An Introduction to Description Logic
- Efficient Approximations of Conjunctive Queries
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Semantically Acyclic Conjunctive Queries under Functional Dependencies
- The Parameterized Complexity of Counting Problems
- Ontology-Based Data Access
- #NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
- Semantic Optimization of Conjunctive Queries
- Counting Answers to Existential Questions
- Fast Query Answering over Existential Rules
- Querying the Guarded Fragment
- Linking Data to Ontologies
- A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
This page was built for publication: Answer Counting under Guarded TGDs
