Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

View updates in stratified disjunctive databases

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

The view update problem is considered in the context of deductive databases where the update of an intensional predicate is accomplished by modifying appropriately the underlying relations in the extensional database. Two classes of disjunctive databases are considered. The first class contains those disjunctive databases which allow only definite rules in the intensional database and disjunctive facts in the extensional database. The second class contains stratified disjunctive databases so that in addition to the first class, negation is allowed in the bodies of the rules, but the database must be stratified. Algorithms are given both for the insertion of an intensional predicate into and the deletion of an intensional predicate from the database. The algorithms use SLD resolution and the concept of minimal models of the extensional database. The algorithms are proved to be correct and best according to the criterion of causing minimal change to the database, where we give first priority to minimizing deletions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Apt, K. R., Blair, H. A. and Walker, A., ‘Towards a theory of declarative knowledge’, inFoundations of Deductive Databases and Logic Programming, (ed. J. Minker), Morgan Kaufmann, pp. 89–148 (1987).

  2. Fagin, R., Ullman, J. and Vardi, M., ‘On the semantics of updates in databases’, inProceedings of the Second ACM Symposium on the Principles of Database Systems pp. 352–365 (1983).

  3. Fernandez, J. and Minker, J., ‘Bottom up evaluation of disjunctive deductive databases’, Submitted.

  4. Guessoum, A. and Lloyd, J., ‘Updating knowledge bases’,New Generation Computing 8 71–89 (1990).

    Google Scholar 

  5. Guessoum, A. and Lloyd, J., ‘Updating knowledge bases II’,New Generation Computing 10 73–100 (1991).

    Google Scholar 

  6. Minker, J., ‘On indefinite databases and the closed world assumption’, inLecture Notes in Computer Sciences, Vol. 138, Springer Verlag, pp. 292–308 (1982).

    Google Scholar 

  7. Reiter, R., ‘On closed world data bases’, inLogic and Data Bases, (eds. H. Gallaire and J. Minker), Plenum, pp. 119–140 (1978).

  8. Rossi, F. and Naqvi, S., ‘Contributions to the view update problem’, InProceeding of the Sixth International Conference on Logic Programming, pp. 398–415 (1989).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported by the National Science Foundation under grant numbers IRI-8916059, IRI-8921591, IRI-9200898, and IRI-9210220.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grant, J., Horty, J., Lobo, J. et al. View updates in stratified disjunctive databases. J Autom Reasoning 11, 249–267 (1993). https://doi.org/10.1007/BF00881907

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881907

Key words

Navigation