How Hard Is Completeness Reasoning for Conjunctive Queries?
- 27 August 2020
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and ComplexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2019
- Tree size reduction with keeping distinguishabilityTheoretical Computer Science, 2018
- Multi-label Learning with Highly Incomplete Data via Collaborative EmbeddingPublished by Association for Computing Machinery (ACM) ,2018
- On the Complexity of Bounded View Propagation for Conjunctive QueriesIEEE Transactions on Knowledge and Data Engineering, 2017
- On Querying Incomplete Information in Databases under Bag SemanticsPublished by International Joint Conferences on Artificial Intelligence ,2017
- On the complexity of sampling query feedback restricted database repair of functional dependency violationsTheoretical Computer Science, 2016
- Identifying the Extent of Completeness of Query Answers over Partially Complete DatabasesPublished by Association for Computing Machinery (ACM) ,2015
- Parameterized Complexity TheoryPublished by Springer Science and Business Media LLC ,2006
- Fixed-Parameter Tractability, Definability, and Model-CheckingSIAM Journal on Computing, 2001
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979