This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Logical Framework for Querying and Repairing Inconsistent Databases
November/December 2003 (vol. 15 no. 6)
pp. 1389-1408

Abstract—In this paper, we address the problem of managing inconsistent databases, i.e., databases violating integrity constraints. We propose a general logic framework for computing repairs and consistent answers over inconsistent databases. A repair for a possibly inconsistent database is a minimal set of insert and delete operations which makes the database consistent, whereas a consistent answer is a set of tuples derived from the database, satisfying all integrity constraints. In our framework, different types of rules defining general integrity constraints, repair constraints (i.e., rules defining conditions on the insertion or deletion of atoms), and prioritized constraints (i.e., rules defining priorities among updates and repairs) are considered. We propose a technique based on the rewriting of constraints into (prioritized) extended disjunctive rules with two different forms of negation (negation as failure and classical negation). The disjunctive program can be used for two different purposes: to compute "repairs" for the database and produce consistent answers, i.e., a maximal set of atoms which do not violate the constraints. We show that our technique is sound, complete (each preferred stable model defines a repair and each repair is derived from a preferred stable model), and more general than techniques previously proposed.

[1] S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995.
[2] S. Agarval, A.M. Keller, G. Wiederhold, and K. Saraswat, “Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases,” Proc. ICDE'95 11th IEEE Conf. Data Eng. pp. 495-504, Feb. 1995.
[3] M. Arenas, L. Bertossi, and J. Chomicki, “Consistent Query Answers in Inconsistent Databases,” Proc. ACM Symp. Principles of Database Systems, pp. 68-79, 1999.
[4] M. Arenas, L. Bertossi, and J. Chomicki, Specifying and Querying Database Repairs Using Logic Programs with Exceptions Proc. Int'l Conf. Flexible Query Answering, pp. 27-41, 2000.
[5] M. Arenas, L. Bertossi, and J. Chomicki, Scalar Aggregation in FD-Inconsistent Databases Proc. Int'l Conf. Database Theory, pp. 39-53, 2001.
[6] C. Baral, S. Kraus, and J. Minker, Combining Multiple Knowledge Bases IEEE Trans. Knowledge and Data Eng., vol. 3, no. 2, pp. 208-220, June 1991.
[7] C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian, Combining Knowledge Bases Consisting of First Order Theories Proc. ISMIS Conf., pp. 92-101, 1991.
[8] R. Ben-Eliyahu and R. Dechter, On Computing Minimal Models Annals of Math. and Artificial Intelligence, vol. 18, no. 1, pp. 3-27, 1996.
[9] S. Brass, J. Dix, I. Niemelae, and T. Przymusinski, On the Equivalence of the STATIC and Disjunctive Well-Founded Semantics and Their Computation Theoretical Computer Science, vol. 258, nos. 1-2, pp. 523-553, 2001.
[10] F. Bry, Query Answering in Information System with Integrity Constraints Proc. IFIP WG 11.5 Working Conf. Integrity and Control in Information System, 1997.
[11] F. Bry and R. Manthey, “Checking Consistency of Database Constraints: A Logical Basis,” Proc. 12th Int'l Conf. Very Large Data Bases (VLDB '86), Aug. 1986.
[12] F. Bry, "Intensional Updates: Abduction via Deduction," Proc. Int'l Conf. Logic Programming, 1990.
[13] F. Bry and A.H. Yahya, Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation J. Automated Reasoning, vol. 25, no. 1, pp. 35-82, 2000.
[14] A. Lejeune and F. Ferrie, "Partioning Range Images Using Curvature and Scale," Proc. 1993 IEEE Conf. Computer Vision and Pattern Recognition, pp. 800-801,New York, June 1993.
[15] M. Cadoli, T. Eiter, and G. Gottlob, “Default Logic as a Query Language,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 448-463, May/June 1997.
[16] J. Dix, U. Furbach, and I. Niemela, Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations Handbook of Automated Reasoning, pp. 1241-1354, 2001.
[17] P.M. Dung, Integrating Data from Possibly Inconsistent Databases Proc. Int'l Conf. Cooperative Information Systems, pp. 58-65, 1996.
[18] T. Eiter, G. Gottlob, and H. Mannila, “Disjunctive Datalog,” ACM Trans. Database Systems, vol. 22, no. 3, pp. 364-418, 1997.
[19] T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello, “A Deductive System for Non-Monotonic Reasoning,” Proc. Int'l Conf. Logic Programming and Nonmonotonic Reasoning, pp. 363-374, 1997.
[20] E. Franconi, A. Laureti Palma, N. Leone, S. Perri, and F. Scarcello, Census Data Repair: A Challenging Application of Disjunctive Logic Programming Proc. Int'l Conf. Logic for Programming and Automated Reasoning, pp. 561-578, 2001.
[21] M. Gelfond and V. Lifschitz, The Stable Model Semantics for Logic Programming Proc. Fifth Conf. Logic Programming, pp. 1070-1080, 1988.
[22] M. Gelfond and V. Lifschitz, Classical Negation in Logic Programs and Disjunctive Databases New Generation Computing, vol. 9, pp. 365-385, 1991.
[23] J. Grant and V.S. Subrahmanian, Reasoning in Inconsistent Knowledge Bases IEEE Trans. Knowledge and Data Eng., vol. 7, no. 1, pp. 177-189 Feb. 1995.
[24] S. Greco and D. Saccá, “Negative Logic Programming,” Proc. North Am. Logic Programing Conf., 1991.
[25] S. Greco, “Binding Propagation into Disjunctive Databases,” Proc. 24rd Int'l Conf. Very Large Data Bases, pp. 287-298, Aug. 1998.
[26] S. Greco and D. Sacca, Complexity and Expressive Power of Deterministic Semantics for${\rm{DATALOG}}^\neg$ Information and Computation, vol. 153, no. 1, pp. 81-98, 1999.
[27] S. Greco, “Minimal Founded Semantics for Disjunctive Logic Programming,” Proc. Fifth Int'l Conf. Logic Programming and Nonmonotonic Reasoning, pp. 221-235, 1999.
[28] S. Greco and E. Zumpano, Querying Inconsistent Database Proc. Int'l Conf. Logic for Programming and Automated Reasoning, pp. 308-325, 2000.
[29] G. Greco, S. Greco, and E. Zumpano, Deterministic Semantics for Disjunctive Logic Programs Proc. AGP Int'l Conf. Declarative Programming, 2001.
[30] G. Greco, S. Greco, and E. Zumpano, “A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases,” Proc. Int'l Conf. Logic Programming, pp. 348-364, 2001.
[31] P.C. Kanellakis, "Elements of Relational Database Theory," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., chapter 17, Elsevier Science, 1990.
[32] R.A. Kowalski and F. Sadri, Logic Programs with Exceptions New Generation Computing, vol. 9, nos. 3/4, pp. 387-400, 1991.
[33] J. Lin, A Semantics for Reasoning Consistently in the Presence of Inconsistency Artificial Intelligence, vol. 86, no. 1, pp. 75-95, 1996.
[34] J. Lin, Integration of Weighted Knowledge Bases Artificial Intelligence, vol. 83, no. 2, pp. 363-378, 1996.
[35] J. Lin and A.O. Mendelzon, Merging Databases under Constraints Int'l J. Cooperative Information Systems, vol. 7, no. 1, pp. 55-76, 1998.
[36] J. Lin and A.O. Mendelzon, Knowledge Base Merging by Majority Dynamic Worlds: From the Frame Problem to Knowledge Management, R. Pareschi and B. Fronhoefer eds., Kluwer, 1999.
[37] J. Minker,“On indefinite databases and the closed world assumption,” Proc. Automated Deduction Conf., pp. 292-308, 1982.
[38] J.M. Nicolas, Logic for Improving Integrity Checking in Relational Data Bases Acta Informatica, vol. 18, pp. 227-253, 1982.
[39] I Niemela, Stable Model Semantics: From Theory to Implementations and Applications Proc. Tutorial First Int'l Conf. Computational Logic (CL2000), 2000.
[40] L.M. Pereira, J.J. Alferes, and J.N. Aparicio, Contradiction Removal Semantics with Explicit Negation Knowledge Representation and Reasoning Under Uncertainty, M. Masuch and L. Polos, eds., pp. 91-106, Springer-Verlag, 1994.
[41] K.A. Ross, The Well Founded Semantics for Disjunctive Logic Programs Proc. Int'l Conf. Deductive and Object-Oriented Databases, pp. 385-402, 1989.
[42] D. Sacca and C. Zaniolo, Deterministic and Non-Deterministic Stable Models J. Logic and Computation, vol. 7, no. 5, pp. 555-579, 1997.
[43] C. Sakama and K. Inoue, Prioritized Logic Programming and Its Application to Commonsense Reasoning Artificial Intelligence, vol. 123, pp. 185-222, 2000.
[44] V.S. Subrahmanian, "Amalgamating Knowledge Bases," ACM Trans. Database Systems, 1994.
[45] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[46] X. Wang, J. You, and L. Yuan, “Nonmonotonic Reasoning by Monotonic Inferences with Priority Constraint,” Proc. Post ICSLP Workshop Nonmonotonic Extensions of Logic Programming, pp. 91–110, 1997.
[47] Y. Zang and N. Foo, Answer Sets for Prioritized Logic Programs Proc. Int'l Logic Programming Symp., pp. 69-83, 1997.

Index Terms:
Inconsistent database, database repairs, consistent queries, disjunctive databases, repair and prioritized constraints.
Citation:
Gianluigi Greco, Sergio Greco, Ester Zumpano, "A Logical Framework for Querying and Repairing Inconsistent Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1389-1408, Nov.-Dec. 2003, doi:10.1109/TKDE.2003.1245280
Usage of this product signifies your acceptance of the Terms of Use.