Skip to main content
Springer Nature Link
Log in

Updating knowledge bases

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We consider the problem of updating a knowledge base, where a knowledge base is realised as a normal (logic) program. We present procedures for deleting an atom from a normal program and inserting an atom into a normal program, concentrating particularly on the case when negative literals appear in the bodies of program clauses. We also prove various properties of the procedures including their correctness.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

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

References

  1. Abiteboul, S., “Updates, a new frontier,” inProceedings of the Second International Conference on the Theory of Databases (M. Gyssens, J. Paredaens, and D. Van Gucht, eds.),Lecture Notes in Computer Science, 326, Springer-Verlag, pp. 1–18, 1988.

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

  3. Apt, K. R. and Pugin, J. M., “Management of Stratified Databases,”Technical Report, TR87-41, Department of Computer Science, The University of Texas at Austin, November, 1987.

  4. Bancilhon, F. and Spyratos, N., “Update semantics of relational views,”ACM Transactions on Database Systems, Vol. 6, No. 4, pp. 557–575, 1981.

    Article  Google Scholar 

  5. Bowen, K. A. and Kowalski, R. A., “Amalgamating language and metalanguage in logic programming,” inLogic Programming (K. L. Clark and S.-Å. Tärnlund, eds.), Academic Press, pp. 153–172, 1982.

  6. Bry, F., “Intensional Updates: Abduction via Deduction,”Technical Report, IR-KB-68, ECRC, November, 1989.

  7. Cavedon, L., “Continuity, consistency, and completeness properties for logic programs,” inSixth International Conference on Logic Programming (G. Levi and M. Martelli, eds.), Lisbon, pp. 571–584, 1989.

  8. Charniak, E. and McDermott, D.,Introduction to Artificial Intelligence, Addison-Wesley, 1986.

  9. Cosmadakis, S. S. and Papadimitriou, C. H., “Updates of relational views,”JACM, Vol. 31, No. 4, pp. 742–760, 1984.

    Article  MathSciNet  Google Scholar 

  10. Cox, P. T. and Pietrzykowski, T., “Causes for events: their computation and applications,” inProceedings of the Eighth International Conference on Automated Deduction (J. H. Siekmann, ed.),Lecture Notes in Computer Science, 230, Springer-Verlag, pp. 608–621, 1986.

  11. Date, C. J., “Updating views,” inRelational Database, Selected Writings, Addison-Wesley, pp. 367–395, 1986.

  12. Dayal, U. and Bernstein, P. A., “On the correct translation of update operations on relational views,”ACM Transactions on Database Systems, Vol. 8, No. 3, pp. 381–416, 1982.

    Article  MathSciNet  Google Scholar 

  13. de Kleer, J., “An assumption-based TMS,”Artificial Intelligence, 28, pp. 127–162, 1986.

    Article  Google Scholar 

  14. Decker, H., “Drawing Updates from Derivations,”Technical Report, IR-KB-65, ECRC, March, 1989, revised September, 1989.

  15. Eshghi, K. and Kowalski, R. A., “Abduction compared with negation by failure,” inSixth International Conference on Logic Programming (G. Levi and M. Martelli, eds.), Lisbon, MIT Press, pp. 234–254, 1989.

    Google Scholar 

  16. Fagin, R., Kuper, G. M., Ullman, J. D., and Vardi, M. Y., “Updating logical databases,”Advances in Computing Research, 3, pp. 1–18, 1986.

    Google Scholar 

  17. Fagin, R., Ullman, J. D., and Vardi, M. Y., “On the semantics of updates in databases,” inProceedings of the Second ACM Symposium on the Principles of Database Systems, pp. 352–365, 1983.

  18. Furtado, A. L., Sevcik, K. C., and Dos Santos, C. S., “Permitting updates through views of databases,”Information Systems, 4, pp. 269–283, 1979.

    Article  Google Scholar 

  19. Lloyd, J. W.,Foundations of Logic Programming (second edition), Springr-Verlag, 1987.

  20. McDermott, D. and Doyle, J., “Non-monotonic logic I,”Artificial Intelligence, 13, pp. 41–72, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  21. Miyachi, T., Kunifuji, S., Furukawa, K., and Kitakami, H., “Constraint-Based Logic Database Management: Structuring Meta-knowledge in Database Management,”ICOT Technical Report,TM-0095, 1985.

  22. Miyachi, T., Kunifuji, S., Kitakami, H., Furukawa, K., Takeuchi, A., and Yokota, H., “A Knowledge Assimilation Method for Logic Databases,”ICOT Technical Report, TR-025, 1983.

  23. Nicolas J. M. and Yazdanian, K., “An outline of BDGEN: a deductive DBMS,” inProceedings of IFIP 83 (R. E. A. Mason, ed.), pp. 711–717, 1983.

  24. Osman, I. M., “Updating defined relations,” inProceedings of the National Computer Conference, Arlington, Va., AFIPS Press, pp. 733–740, 1979.

  25. Pereira, L. M., Calejo, M., and Aparicio, J. N., “Refining Knowledge Base Updates,”Technical Report, AI center/Uninova, Portugal, November, 1989.

  26. Poole, D., “A logical framework for default reasoning,”Artificial Intelligence, 36, pp. 27–47, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  27. Reiter, R., “A logic for default reasoning,”Artificial Intelligence, 13, pp. 81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  28. Rossi, F. and Naqvi, S. A., “Contributions to the view update problem,” inSixth International Conference on Logic Programming (G. Levi and M. Martelli, eds.), pp. 398–415, Lisbon, 1989.

  29. Sato, T., “Completed logic programs and their consistency,” 1988. To appear inThe Journal of Logic Programming.

  30. Sato, T., “On Consistency of First Order Logic Programs,”Technical Report, TR-87-12, Electrotechnical Laboratory, Ibaraki, Japan, 1987.

  31. Tomasic, A., “View update translation via deduction and annotation,” inProceedings of the Second International Conference on the Theory of Databases (M. Gyssens, J. Paredaens, and D. Van Gucht, eds.),Lecture Notes in Computer Science, 326, Springer-Verlag, pp. 338–352, 1988.

  32. Weber, A., “Updating propositional formulas,” inProceedings from the First International Conference on Expert Database Systems (L. Kerschberg, ed.), Benjamin/ Cummings Publishing Company, Menlo Park, California, pp. 487–500, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bristol, University Walk, BS8 1TR, Bristol, U. K.

    A. Guessoum & J. W. Lloyd

Authors
  1. A. Guessoum
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. J. W. Lloyd
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to A. Guessoum.

About this article

Cite this article

Guessoum, A., Lloyd, J.W. Updating knowledge bases. New Gener Comput 8, 71–89 (1990). https://doi.org/10.1007/BF03037514

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords