Complexity of Consistent Query Answering in Databases Under Cardinality-Based and Incremental Repair Semantics
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 179-193
- https://doi.org/10.1007/11965893_13
Abstract
No abstract availableKeywords
Other Versions
This publication has 24 references indexed in Scilit:
- Minimal-change integrity maintenance using tuple deletionsInformation and Computation, 2005
- Consistent Query Answers on Numerical Databases Under Aggregate ConstraintsLecture Notes in Computer Science, 2005
- Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity ConstraintsLecture Notes in Computer Science, 2005
- Answer sets for consistent query answering in inconsistent databasesTheory and Practice of Logic Programming, 2003
- Scalar aggregation in inconsistent databasesTheoretical Computer Science, 2003
- Enhancing Disjunctive Datalog by constraintsIEEE Transactions on Knowledge and Data Engineering, 2000
- Consistent query answers in inconsistent databasesPublished by Association for Computing Machinery (ACM) ,1999
- Parameterized ComplexityPublished by Springer Science and Business Media LLC ,1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- On the complexity of propositional knowledge base revision, updates, and counterfactualsArtificial Intelligence, 1992