Analytic tableaux and database repairs: Foundations

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

Volumn 2284, Issue , 2002, Pages 32-48

  Bertossi, Leopoldo ^a   Schwind, Camilla ^b  

^a CARLETON UNIVERSITY   (Canada)

^b LIM CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

CONSISTENT QUERY ANSWERING; DATABASE REPAIRS; INTEGRITY CONSTRAINTS; RELATIONAL DATABASE;

QUERY PROCESSING;

EID: 84956984805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45758-5_3     Document Type: Conference Paper

References (17)

1. M. Arenas, L. Bertossi and J. Chomicki. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems (ACM PODS’99), 1999, pp. 68–79.
2. M. Arenas, L. Bertossi and J. Chomicki. Scalar Aggregation in FD-Inconsistent Databases. In Database Theory - ICDT 2001 (Proc. International Conference on Database Theory, ICDT’2001). Springer LNCS 1973, 2001, pp. 39 – 53.
3. L. Bertossi and C. Schwind. An Analytic Tableaux based Characterization of Database Repairs for Consistent Query Answering (preliminary report). In Working Notes of the IJCAI’01 Workshop on Inconsistency in Data and Knowledge, AAAI Press, 2001, pp. 95 – 106.
4. E. W. Beth. The Foundations of Mathematics. North Holland, 1959.
5. F. Bry. Query Answering in Information Systems with Integrity Constraints. In Proc. IFIP WG 11.5 Working Conference on Integrity and Control in Information Systems, Chapman & Hall, 1997.
6. A. Celle and L. Bertossi. Querying Inconsistent Databases: Algorithms and Implementation. In ‘Computational Logic - CL 2000’, J. Lloyd et al. (eds.). Stream: 6th International Conference on Rules and Objects in Databases (DOOD’2000). Lecture Notes in Artificial Intelligence 1861, Springer 2000, pp. 942 – 956.
7. L. Cholvy. A General Framework for Reasoning about Contradictory Information and some of its Applications. In Proceedings of ECAI Workshop “Conflicts among Agents”, Brighton, England, August 1998.
8. M. Fitting. First Order Modal Tableaux. Journal of Automated Reasoning, 4(2), 191–213, 1988.
9. M. Fitting. First Order Logic and Automated Theorem Proving. Texts and Monographs in Computer Science. Springer Verlag, 1990.
10. G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3), 1992.
11. E. Lafon and C. B. Schwind. A Theorem Prover for Action Performance. In Y. Kodratoff, editor, Proceedings of the 8th European Conference on Artificial Intelligence, pages 541–546. Pitman Publishing, 1988.
12. R. Reiter. Towards a Logical Reconstruction of Relational Database Theory. In ‘On Conceptual Modeling’, Brodie, M. L. and Mylopoulos, J. and Schmidt, J. W. (eds.), Springer-Verlag, 1984, pp. 191–233.
13. R. Reiter. A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values. Journal of the ACM, 33(2): 349–370, 1986.
14. C. B. Schwind. A Tableau-based Theorem Prover for a Decidable Subset of Default Logic. In M. E. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, number 449 in Lecture Notes in Artificial Intelligence, pages 541–546. Springer Verlag, July 1990.
15. C. B. Schwind and V. Risch. Tableau-based Characterisation and Theorem Proving for Default Logic. Journal of Automated Reasoning, 13(4):223–242, 1994.
16. R. M. Smullyan. First Order Logic. Springer, 1968.
17. M. Winslett. Reasoning about Action with a Possible Models Approach. In Proceedings of the 8th National Conference on Artificial Intelligence, pages 89–93, 1988.