Abstract
A new method is proposed of restoring integrity constraints after committing an external update of a data base. This method is conservative in the sense that it performs the minimum of the necessary changes in the initial data base. The method is based on a novel idea of a so called preference strategy, i.e. an “oracle” which resolves globally all the conflicts, taking into account the update to be committed.
This work was sponsored partly by INTAS (Grant 94-2412) and by the Russian Fundamental Studies Foundation (Grants 96-01-00395, 97-01-00973).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bidoit, N., Maabout, S.: Update Programs Versus Revision Programs. In: “Non-Monotonic Extensions of Logic Programming”. Proc. of the Workshop at the International Logic Programming Conference, JICSLP'96. (September 1996). (To appear in LNAI 1216)
Dayal, U., Hanson,E., and Widom, J.: Active database systems. In: W. Kim, editor, Modern Database Systems. Addison Wesley (1995) 436–456
Eiter, T., Gottlob, G.: On the complexity of prepositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence 57 (1992) 227–270
Fagin, R., Kuper, G., Ullman, J., and Vardi, M.Y.: Updating Logical Databases. In: P. Kanellakis, editor, Advances in Computing Research, JAI Press 3 (1986) 1–18
Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: R. Kovalsky and K. Bowen, editors, Proc. of the 5th Intern. Symp. on Logic Programming. Cambridge, MA, MIT Press (1988) 1070–1080
Halfeld Ferrari Alves, M., Laurent, D., Spyratos, N., Stamate, D.: Update rules and revision programs. Rapport de Recherche Université de Paris-Sud, Centre d'Orsay, LRI 1010 (12/1995)
Karp, R.M.: Reducibility among combinatorial problems. In: R.E.Miller and J.W.Thatcher, editors, Complexity of Computer Computations. N.-Y., Plenum Press (1972) 85–103
Katsuno, H., Mendelzon, A. O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52 (1991) 253–294
Marek, V.W., Truszcińsky, M.: Revision programming, database updates and integrity constraints. In: International Conference on Data Base theory, ICDT. LNCS 893 (1995) 368–382
Picouet, Ph., Vianu, V.: Expressiveness and Complexity of Active Databases. In: Afrati, F., Kolaitis, Ph., editors, 6th Int. Conf. on Database Theory, ICDT'97. LNCS 1186 (1997) 155–172
Przymusinski, T.C., Turner, H.: Update by Means of Inference Rules. In: V.W. Marek, A.Nerode, M.Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning. Proc. of the Third Int. Conf. LPNMR'95, Lexington, KY, USA (1995) 166–174
Raschid, L., Lobo, J.: Semantics for Update Rule Programs and Implementation in a Relational Database Management System. ACM Trans. on Database Systems 21 (December 1996) 526–571
Van Gelder, A., Ross, K.A., and Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38 (1991) 620–650
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekhtyar, M., Dikovsky, A., Spyratos, N. (1997). On conservative enforced updates. In: Dix, J., Furbach, U., Nerode, A. (eds) Logic Programming And Nonmonotonic Reasoning. LPNMR 1997. Lecture Notes in Computer Science, vol 1265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63255-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-63255-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63255-9
Online ISBN: 978-3-540-69249-2
eBook Packages: Springer Book Archive