Condensed representation of database repairs for consistent query answering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2572, Issue , 2003, Pages 378-393

  Wijsen, Jef ^a  

^a UNIVERSITY OF MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATABASE SYSTEMS; REPAIR;

CONDENSED REPRESENTATIONS; CONJUNCTIVE QUERIES; CONSISTENT QUERY ANSWERING; CONSISTENT VALUES; DATABASE REPAIRS; INTEGRITY CONSTRAINTS; QUERY ANSWERING;

QUERY PROCESSING;

EID: 35248878671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36285-1_25     Document Type: Article

References (16)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. M. Arenas, L. Bertossi, and M. Kifer. Applications of Annotated Predicate Calculus to Querying Inconsistent Databases. In Proc. 1st Int. Conf., on Computational Logic (CL 2000), volume 1861 of LNAI, pages 926-941. Springer, 2000.
3. M. Arenas, L. E. Bertossi, and J. Chomicki. Consistent query answers in inconsistent databases. In Proc. 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 68-79. ACM Press, 1999.
4. M. Arenas, L. E. Bertossi, and J. Chomicki. Specifying and querying database repairs using logic programs with exceptions. In Proc. 4th Int. Conf. on Flexible Query Answering Systems (FQAS 2000), Advances in Soft Computing, pages 27-41. Springer, 2000.
5. M. Arenas, L. E. Bertossi, and J. Chomicki. Scalar aggregation in FD-inconsistent databases. In Proc. 8th Int. Conf. on Database Theory (ICDT 2001), volume 1973 of LNCS, pages 39-53. Springer, 2001.
6. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. Journal of the ACM, 31(4):718-741, Oct. 1984.
7. L. Bertossi and C. Schwind. Analytic tableaux and database repairs: Foundations. In Proc. 2nd Int. Symposium on Foundations of Information and Knowledge Systems (FolKS 2002), volume 2284 of LNCS, pages 32-48. Springer, 2002.
8. F. Bry. Query answering in information systems with integrity constraints. In First IFIP WG 11.5 Working Conference on Integrity and Internal Control in Information Systems: Increasing the Confidence in Information Systems, Zurich, Switzerland, December 4-5, 1997, pages 113-130. Chapman Hall, 1997.
9. A. Calì, D. Calvanese, G. D. Giacomo, and M. Lenzerini. Data integration under integrity constraints. In Proc. 14th Int. Conf., on Advanced Information Systems Engineering (CAiSE 2002), volume 2348 of LNCS, pages 262-279. Springer, 2002.
10. G. Greco, S. Greco, and E. Zumpano. A logic programming approach to the integration, repairing and querying of inconsistent databases. In Proc. 17th Int. Conf. on Logic Programming (ICLP 2001), volume 2237 of LNCS, pages 348-364. Springer, 2001.
11. G. Greco, S. Greco, and E. Zumpano. A logical framework for querying and re-pairing inconsistent databases. IEEE Trans, on Knowledge and Data Engineering, to appear.
12. D. Lembo, M. Lenzerini, and R. Rosati. Source inconsistency and incompleteness in data integration. In Proc. 9th Int. Workshop on Knowledge Representation meets Databases (KRDB 2002), number 54 in CEUR Workshop Proceedings, 2002.
13. J. Lin and A. O. Mendelzon. Merging databases under constraints. International Journal of Cooperative Information Systems, 7(l):55-76, 1998.
14. S.-H. Nienhuys-Cheng and R. de Wolf. The subsumption theorem in inductive logic programming: Facts and fallacies. In L. D. Raedt, editor, Advances in Inductive Logic Programming, pages 265-276. IOS Press, 1996.
15. G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 153-163, Edinburgh, 1969. Edinburgh University Press.
16. P. R. J. van der Laag and S.-H. Nienhuys-Cheng. Completeness and properness of refinement operators in inductive logic programming. Journal of Logic Program-ming, 34(3):201-225, 1998.