Updating Disjunctive Databases via Model Trees

John Grant, Jaroslaw Gryz, Jack Minker

• DVI
• PS

Abstract

In this paper we study the problem of updating disjunctive databases, which contain indefinite data given as positive disjunctive clauses. We give correct algorithms for the insertion of a clause into and the deletion of a clause from such databases. Although the algorithms presented here are oriented towards model trees, they apply to any representation of minimal models.

Bibliography

• [1] J.A. Fernandez, J. Minker, and A. Yahya. Computing perfect and sta- ble models using ordered model trees. Technical Report CS-TR-3195 and UMIACS-TR-93-136, University of Maryland Institute for Advanced Computer Studies, College Park, MD 20742, December 1993. Submitted to the Journal of Computational Intelligence.
• [2] Jose Alberto Fernandez. Disjunctive Deductive Databases. PhD thesis, University of Maryland, Department of Computer Science, College Park, 1994.
• [3] Jose Alberto Fernandez, John Grant, and Jack Minker. Model theo- retic approach to view updates in deductive databases. Technical Report CS-TR-3335, Department of Computer Science, University of Maryland, College Park, MD 20742, 1994.
• [4] Jose Alberto Fernandez and Jack Minker. Bottom-up evaluation of Hi- erarchical Disjunctive Deductive Databases. In Koichi Furukawa, editor, Logic Programming Proceedings of the Eighth International Conference, pages 660-675. MIT Press, 1991.
• [5] J. Grant, J. Horty, J. Lobo, and J. Minker. View updates in stratified dis- junctive databases. Journal of Automated Reasoning, 11:249-267, 1993.
• [6] A. Yahya. Notes on updates in logic databases. (unpublished)