From database repair programs to consistent query answering in classical logic (extended abstract)

CEUR Workshop Proceedings

Volumn 450, Issue , 2009, Pages

  Bertossi, Leopoldo ^a,b  

^a CARLETON UNIVERSITY   (Canada)

^b Toronto Lab   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; CONSISTENT QUERY ANSWERING; DATABASE REPAIRS; DISJUNCTIVE LOGIC PROGRAMS; EXTENDED ABSTRACTS; FIRST-ORDER THEORIES; INCONSISTENT DATABASE; PREDICATE LOGIC; QUANTIFIER ELIMINATION; REPAIR PROGRAM; SECOND ORDERS; STABLE MODEL;

DATABASE SYSTEMS; INFORMATION MANAGEMENT; LOGIC PROGRAMMING; QUERY PROCESSING;

REPAIR;

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

References (40)

1. Abiteboul, S., Hull, R. and Vianu, V. Foundations of Databases. Addison-Wesley, 1995.
2. Ackermann,W. Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 1935, 110:390-413.
3. Ackermann, W. Solvable cases of the Decision Problem. North-Holland Pub. Co., 1954.
4. Arenas, M., Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems, ACM Press, 1999, pp. 68-79.
5. Arenas, M., Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming, 2003, 3(45):393-424.
6. Barcelo, P. and Bertossi, L. Logic Programs for Querying Inconsistent Databases. Proc. Practical Aspects of Declarative Languages, Springer LNCS 2562, 2003, pp. 208-222.
7. Barcelo, P., Bertossi, L. and Bravo, L. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. In Semantics of Databases, Springer LNCS 2582, 2003, pp. 1-27.
8. Ben-Eliyahu, R. and Dechter, R. Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 1994, 12(1-2):53-87.
9. Bertossi, L. and Schwind, C. Database Repairs and Analytic Tableaux. Annals of Mathematics and Artificial Intelligence, 2004, 40(1-2):5-35.
10. Bertossi, L. Consistent Query Answering in Databases. In ACM Sigmod Record, June 2006, 35(2):68-76.
11. Bertossi, L. From Database Repair Programs to Consistent Query Answering in Classical Logic. Extended version: http://www.scs.carleton.ca/~bertossi/ papers/FrRP2CQAext2.pdf
12. Bravo, L., Bertossi, L. Semantically Correct Query Answers in the Presence of Null Values. Proc. EDBT WS on Inconsistency and Incompleteness in Databases, Springer LNCS 4254, 2006, pp. 336-357.
13. Caniupan, M., Bertossi, L. Optimizing Repair Programs for Consistent Query Answering. Proc. International Conference of the Chilean Computer Science Society, IEEE Computer Society Press, 2005, pp. 3-12.
14. Caniupan, M., Bertossi, L. The Consistency Extractor System: Querying Inconsistent Databases using Answer Set Programs. Proc. of the Scalable Uncertainty Management Conference, Springer LNCS 4772, 2007, pp. 74-88.
15. Caniupan, M. and Bertossi, L. The Consistency Extractor System: Answer Set Programs for Consistent Query Answering in Databases. Journal submission, 2009.
16. Chomicki, J. and Marcinkowski, J. Minimal-Change Integrity Maintenance using Tuple Deletions. Information and Computation, 2005, 197(1-2):90121.
17. Chomicki, J. Consistent Query Answering: Five Easy Pieces. Proc. International Conference on Database Theory, Springer LNCS 4353, 2007, pp. 1-17.
18. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. Complexity and Expressive Power of Logic Programming. ACM Computing Surveys, 2001, 33(3):374-425.
19. Doherty, P., Lukaszewicz, W. and Szalas, A. Computing Circumscription Revisited. A Reduction Algorithm. Journal of Automated Reasoning, 1997, 18(3):297-336.
20. Eiter, T. and Gottlob, G. Expressiveness of Stable Model Semantics for Disjunctive Logic Programs with Functions. Journal of Logic Programming, 1997, 33(2):167-178.
21. Eiter, T., Gottlob, G. and Mannila, H. Disjunctive Datalog. ACM Transactions on Database Systems, 1997, 22(3):364-418.
22. Fagin, R. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation, R. Karp (ed.), SIAM-AMS Proceedings 7, 1974, pp. 43-73.
23. Ferraris, P., Lee, J. and Lifschitz, V. A New Perspective on Stable Models. In Proc. International Joint Conference on Artificial Intelligence, 2007, pp. 372-379.
24. Ferraris, P., Lee, J. and Lifschitz, V. Stable Models and Circumscription. Artificial Intelligence (to appear). http://www.cs.utexas.edu/ users/vl/papers/smcirc.ps
25. Fuxman, A. and Miller, R. Towards Inconsistency Management in Data Integration Systems. Proc. Workshop on Information Integration on the Web (IIWeb), 2003.
26. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. J. Computer and Systems Sciences, 2007, 73(4):610-635.
27. Gelfond, M., Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 1991, 9(3/4):365-385.
28. 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):13891408.
29. Libkin, L. Elements of Finite Model Theory. Springer, 2004.
30. Lifschitz, V. Computing Circumscription. Proc. International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1985, pp. 121-127.
31. Lifschitz, V. Circumscription. In Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3. Oxford University Press, 1994, pp.297-352.
32. Lloyd, J.W. Foundations of Logic Programming. Springer Verlag, 1987.
33. Lopatenko, A. and Bertossi, L. Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics. Proc. International Conference of Database Theory, Springer LNCS 4353, 2007, pp. 179-193.
34. Lifschitz, V. and Turner, H. Splitting a Logic Program. Proc. International Conference on Logic Programming, MIT Press, 1994, pp. 23-37.
35. Lifschitz, V. Twelve Definitions of Stable Model. Proceedings International Conference on Logic Programming. Springer LNCS 5366, 2008, pp. 37-51.
36. McCarthy, J. Circumscription - A Form of Non-Monotonic Reasoning. Artificial Intelligence, 1980, 13(1-2):27-39.
37. Przymusinski, T. On the Declarative Semantics of Deductive Databases and Logic Programs. In Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufmann Publishers Inc., 1988, pp. 193-216.
38. Przymusinski, T. Stable Semantics for Disjunctive Programs. New Generation Computing, 1991, 9(3/4):401-424.
39. Reiter, R. Towards a Logical Reconstruction of Relational Database Theory. In On Conceptual Modelling, M.L. Brodie, J. Mylopoulos and J.W. Schmidt (eds.), Springer, 1984, pp. 191-233.
40. Wijsen, J. On the Consistent Rewriting of Conjunctive Queries Under Primary Key Constraints. Proc. International Symposium on Database Programming Languages, Springer LNCS 4797, 2007, pp. 112-126.