Optimizing repair programs for consistent query answering

Proceedings - International Conference of the Chilean Computer Science Society, SCCC

Volumn 2005, Issue , 2005, Pages 3-12

  Caniupan, Monica ^a   Bertossi, Leopoldo ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; REPAIR; SEMANTICS; SET THEORY;

AGGREGATE FUNCTIONS; MODEL COMPUTATION; QUERY ANSWERING; REPAIR PROGRAMS;

QUERY LANGUAGES;

EID: 33745224490     PISSN: 15224902     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCCC.2005.1587860     Document Type: Conference Paper

References (25)

1. M. Arenas, L. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. PODS 99, ACM Press, pages 68-79, 1999.
2. M. Arenas, L. Bertossi, and J. Chomicki. Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming, 3(4-5):393-424, 2003.
3. M. Arenas, L. Bertossi, J. Chomicki, X. He, V. Raghavan, and J. Spinrad. Scalar aggregation in inconsistent databases. Theoretical Computer Science, 296:405-434, 2003.
4. P. Barcelo and L. Bertossi. Logic programs for querying inconsistent databases. In Proc. 5th Inter. Symposium on Practical Aspects of Declarative Languages (PADL 03), Springer LNCS, 2562:208-222, 2003.
5. P. Barcelo, L. Bertossi, and L. Bravo. Characterizing and computing semantically correct answers from databases with annotated logic and answer sets. Chapter in book Semantics of Databases, Springer LNCS, 2582:1-27, 2003.
6. C. Beeri and R. Ramakrishnan. On the power of magic. In Proc. PODS 87, ACM Press, pages 269-284, 1987.
7. L. Bravo and L. Bertossi. Consistent query answering under inclusion dependencies. In Proc. CASCON 2004, IBM, pages 202-216, 2004.
8. A. Cali, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. PODS 03, ACM Press, pages 260-271, 2003.
9. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer-Verlag, 1990.
10. J. Chomicki and J. Marcinkowski. Minimal-change integrity maintenance using tuple deletions. Information and Computation, 197(1-2):90-121, 2005.
11. C. Cumbo, W. Faber, G. Greco, and N. Leone. Enhancing the magic-set method for disjunctive datalog programs. In Proc. ICLP 04, Springer LNCS, 3132:371-385, 2004.
12. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Computer Surveys, 33(3):374-425, 2001.
13. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in dlv. In Proc. IJCAI 03, Morgan Kaufmann, pages 847-852, 2003.
14. T. Eiter, M. Fink, G. Greco, and D. Lembo. Efficient evaluation of logic programs for querying data integration systems. In Proc. ICLP 03, Springer LNCS, 2916:163-177, 2003.
15. W. Faber, G. Greco, and N. Leone. Magic sets and their application to data integration. In Proc. ICDT 05, Springer LNCS, 3363:306-320, 2005.
16. W. Faber, N. Leone, and G. Pfeifer. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In Proc. JELIA 04, Springer LNCS, 3229:200-212, 2004.
17. A. Fuxman and R. Miller. First-order query rewriting for inconsistent databases. In Proc. ICDT 05, Springer LNCS, 3363:337-354, 2004.
18. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
19. G. Greco, S. Greco, I. Trubtsyna, and E. Zumpano. Optimization of bound disjunctive queries with constraints. To Appear in Theory and Practice of Logic Programming, (oai:arXiv.org:cs/0406013), 2004.
20. S. Greco. Binding propagation techniques for the optimization of bound disjunctive queries. In IEEE Transactions on Knowledge and Data Engineering, 15(2):368-385, 2003.
21. M. Lenzerini. Data integration: A theoretical perspective. In Proc. PODS 02, ACM Press, pages 233-246, 2002.
22. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The dlv system for konwledge representation and reasoning. To appear in ACM Transactions on Computational Logic, arXiv.org paper cs.LO/0211004.
23. J. Lloyd. Foundations of Logic Programming. Second ed., Springer-Verlag, 1987.
24. K. Ross. Modular stratification and magic sets for datalog programs with negation. J. ACM, 41(6):1216-1266, 1994.
25. A. Van Gelder, K. Ross, and J. Schlipf. Unfounded sets and well-founded semantics for general logic programs. In Proc. PODS 88, ACM Press, pages 221-230, 1988.