On the decidability of consistent query answering

CEUR Workshop Proceedings

Volumn 619, Issue , 2010, Pages

  Arenas, Marcelo ^a   Bertossi, Leopoldo ^b,c,d  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b CARLETON UNIVERSITY   (Canada)

^c IBM Center for Advanced Studies   (Canada)

^d UNIVERSITY OF CONCEPCIÓN   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED COMPLEXITY; CONSISTENT QUERY ANSWERING; DECISION PROBLEMS; INTEGRITY CONSTRAINTS; NEW RESULTS; UNDECIDABILITY;

INFORMATION MANAGEMENT; QUERY LANGUAGES;

COMPUTABILITY AND DECIDABILITY;

EID: 79958029228     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Abiteboul, S., Hull, R. and Vianu, V. Foundations of Databases. Addison-Wesley, 1995.
2. Afrati, F. and Kolaitis, Ph. Repair Checking in Inconsistent Databases: Algorithms and Complexity. Proc. of the International Conference on Database Theory (ICDT 09), 2009, pp. 31-41.
3. Arenas, M., Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems (PODS 99), 1999, pp. 68-79.
4. Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V. and Spinrad, J. Scalar Aggregation in Inconsistent Databases. Theoretical Computer Science, 2003, 296(3): 405-434.
5. Arenas, M., Bertossi, L. and Chomicki, L. Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming, 2003, 3(4-5):393-424.
6. Barcelo, P., Bertossi, L. and Bravo, L. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. Chapter in Semantics of Databases, Springer LNCS 2582, 2003, pp. 1-27.
7. Bertossi, L. Consistent Query Answering in Databases. In ACM Sigmod Record, 2006, 35(2):68-76.
8. Bertossi, L., Bravo,L., Franconi, E. and Lopatenko, A. The Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints. Information Systems, 2008, 33(4):407-434.
9. Börger, E., Grädel, E. and Gurevich, Y. The Classical Decision Problem. Springer, 1997.
10. Bravo, L. and Bertossi, L. Semantically Correct Query Answers in the Presence of Null Values. Proc. EDBT International Workshop on Inconsistency and Incompleteness in Databases (IIDB 06). Springer LNCS 4254, 2006, pp. 336-357.
11. Cali, A., Lembo, D. and Rosati, R. On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases. Proc. ACM Symposium on Principles of Database Systems (PODS 03), 2003, pp. 260-271.
12. Chomicki, J. and Marcinkowski, J. Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation, 2005, 197(1-2):90-121.
13. Chomicki, J. Consistent Query Answering: Five Easy Pieces. Proc. International Conference on Database Theory (ICDT 07), Springer LNCS 4353, 2007, pp. 1-17.
14. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. Complexity And Expressive Power Of Logic Programming. ACM Computer Surveys, 2001, 33(3):374-425.
15. Eiter, T., Gottlob, G. and Mannila, H. Disjunctive Datalog. ACM Transactions on Database Systems, 1997, 22(3):364-418.
16. Ebbinghaus, H.-D. and Flum, J. Finite Model Theory. 2nd edition, Springer, 1999.
17. Fagin, R. Horn Clauses and Database Dependencies. Journal of the ACM, 1982, 29(4):952-985.
18. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. Journal of Computer and System Sciences, 2007, 73(4):610-635.
19. Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 1991, 9:365-385.
20. Greco, G., Greco, S. and Zumpano, E. A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Transactions on Knowledge and Data Engineering, 2003, 15(6):1389-1408.
21. Lopatenko, A. and Bertossi, L. Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics. Proceedings of the International Conference of Database Theory (ICDT 07), Springer LNCS 4353, 2007, pp. 179-193.
22. Papadimitriou, Ch. Computational Complexity. Addison-Wesley, 1994.
23. Staworko, S. and Chomicki, J. Consistent Query Answering in the Presence of Universal Constraints. Information Systems, 2010, 35(1):1-22.
24. Ullman, J. Principles of Database and Knowledge-Base Systems, Vol. I. Computer Science Press, 1988.
25. Van Gelder, A. and Topor, R. Safety and Correct Translation of Relational Calculus Formulas. Proceedings of the Sixth ACM Symposium on Principles of Database Systems (PODS 87). ACM Press, 1987, pp. 313-327.
26. Vardi,M. The Complexity of Relational Query Languages. Proc. ACM Symposium on Theory of Computing (STOC 82), 1982, pp. 137-146.
27. Wijsen, J. Database Repairing Using Updates. ACM Transactions on Database Systems, 2005, 30(3):722-768.
28. Wijsen, J. On the Consistent Rewriting of Conjunctive Queries Under Primary Key Constraints. Information Systems, 2009, 34(7):578-601.